Submission #1867875

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

#define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)

using P = pair<int, int>;

int main() {
    int n, k;
    cin >> n >> k;
    priority_queue<P> pq;
    pq.push(P(1145141919, 512810));

    rep(i, n) {
        int x; cin >> x;
        pq.push(P(x, i + 1));
        if (i >= k - 1) {
            pq.pop();
            cout << pq.top().second << "\n";
        }
    }

    return 0;
}

Submission Info

Judge Result