Submission #1149197

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits>
#include <climits>
#include <functional>
#include <numeric>

using namespace std;

#define alloc(type,n) (type*)calloc(sizeof(type),(n));
typedef long long lli;

lli n,k;
vector<lli> x;
priority_queue<lli> pq;
map<lli,lli> m;


int main(){
    cin >> n >> k;
    x = vector<lli> (n);
    for(lli i = 0;i < n;i++) cin >> x[i];
    lli i;
    for(i = 0;i < k;i++) pq.push(x[i]),m[x[i]] = i+1;
    cout << m[pq.top()] << endl;
    for(;i < n;i++){
        pq.push(x[i]);
        m[x[i]] = i+1;
        pq.pop();
        cout << m[pq.top()] << endl;
    }

	return 0;
}

Submission Info

Judge Result