Submission #3600478

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<cstdio>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;

#define ARRAY_MAX 45
#define INF 1000000007


int main(){


    int n,k;
    cin >> n >> k;
    vector<int> a(n);
    priority_queue<P> pq;
    REP(i,k){
        cin >> a[i];
        pq.push(P(a[i],i));
    }
    cout << pq.top().second+1 << endl;
    
    for(int i = k;i < n;i++){
        cin>> a[i];
        if(pq.top().first > a[i]){
            //候補
            pq.pop();
            pq.push(P(a[i],i));
        }
        cout << pq.top().second+1 << endl;
    }

    return 0;
}

Submission Info

Judge Result