Submission #1353451

---

Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);
#ifndef _DEBUG
	init_global();
#endif

	int N, K; cin >> N >> K;
	vi age(N+1,0), age2rank(N+1,0);
	FOR(r, 1, N+1) {
		cin >> age[r];
		age2rank[age[r]] = r;
	}

	priority_queue<int> pq;

	FOR(r, 1, N+1) {
		pq.push(age[r]);

		int sz = pq.size();
		if (sz == K) {
			cout << age2rank[pq.top()] << endl;
		}
		else if (sz == K + 1) {
			pq.pop();
			cout << age2rank[pq.top()] << endl;
		}
	}

	return 0;
}

Submission Info

Judge Result