Submission #3804975

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define int long long
int mod=1e9+7;

signed main(){
  int n,k;
  cin>>n>>k;
  vector<int> a(n);
  map<int,int> mp;
  for(int i=0;i<n;i++){
    cin>>a[i];
    mp[a[i]]=i;
  }
  priority_queue<int> pq;
  for(int i=0;i<k;i++)pq.push(a[i]);
  cout<<mp[pq.top()]+1<<endl;
  for(int i=k;i<n;i++){
    if(a[i]<pq.top()){
      pq.pop();
      pq.push(a[i]);
    }
    cout<<mp[pq.top()]+1<<endl;
  }
}

Submission Info

Judge Result