Submission #3600529

---

Source Code Expand

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

typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(int i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(int i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())

const int IINF = 1e9 + 10;
const lint LLINF = (lint)1e18 + 10;
const lint MOD = (lint)1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct person{
    int rank, young;

    bool operator<(const person & right) const {
        return young < right.young;
    }
};

int main(){
    int n, k;
    cin >> n >> k;
    vector<person> x(n);
    rep(i, n){
        cin >> x[i].young;
        x[i].rank = i + 1;
    }
    priority_queue<person> que;
    rep(i, k){
        que.push(x[i]);
    }
    REP(i, k, n){
        person p = que.top();
        cout << p.rank << endl;
        if(x[i].young < p.young){
            que.pop();
            que.push(x[i]);
        }
    }
    cout << que.top().rank << endl;
    return 0;
}

Submission Info

Judge Result