Submission #1172169

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

int N, K;
int X, ans[100000];
map<int, int> mp;
priority_queue<int> pq;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N >> K;
  FOR(i, 0, K){
    cin >> X;
    mp[X] = i + 1;
    pq.push(X);
  }
  cout << mp[pq.top()] << endl;
  FOR(i, K, N){
    cin >> X;
    mp[X] = i + 1;
    pq.push(X);
    pq.pop();
    cout << mp[pq.top()] << endl;
  }
}

Submission Info

Judge Result