Submission #1225982

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
	int N, K;  cin >> N >> K;
	priority_queue<P> a;

	for (int i = 0; i < K; i++) {
		int x;
		cin >> x;
		a.push(P(x, i));
	}
	
	cout << a.top().second + 1 << endl;
	for (int i = K; i < N; i++) {
		int x;  cin >> x;
		if (a.top().first > x) {
			a.pop();
			a.push(P(x, i));
		}
		cout << a.top().second + 1 << endl;
	}
	return 0;
}

Submission Info

Judge Result