Submission #2554393

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(int i = 0; i < n; i++)




int main() {
    int n, k;
    cin >> n >> k;
    
    vector<int> x(n);
    REP(i, n){
        cin >> x[i];
    }
    
    priority_queue<pair<int, int>> p;
    
    REP(i, k){
        p.push({x[i], i + 1});
    }
    cout << p.top().second << endl;
    
    for(int i = k; i < n; i++){
        p.push({x[i], i + 1});
        p.pop();
        cout << p.top().second << endl;
    }
}

Submission Info

Judge Result