Submission #1379784

---

Source Code Expand

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
    int N, K;
    cin >> N >> K;
    int X[N];
    REP(i, N) cin >> X[i];
    priority_queue<pii> pq;
    REP(i, K){
        pii x;
        x.first = X[i];
        x.second = i+1;
        pq.push(x);
    }
    cout << (pq.top()).second << endl;
    for(int i=K;i<N;i++){
        pii x;
        x.first = X[i];
        x.second = i+1;
        pq.push(x);
        pq.pop();
        cout << (pq.top()).second << endl;
    }
    return 0;
}

Submission Info

Judge Result