Submission #1680924

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    priority_queue<int> pq;
    map<int, int> mp;
    int n, k;
    cin >> n >> k;
    imfor(i, n) {
        int x;
        cin >> x;
        mp[x] = i + 1;
        if (pq.size() < k) {
            pq.push(x);
            if (pq.size() == k) {
                cout << mp[pq.top()] << endl;
            }
        } 
        else {
            if (pq.top() < x) {
                cout << mp[pq.top()] << endl;
            }
            else {
                pq.push(x);
                pq.pop();
                cout << mp[pq.top()] << endl;
            }
        }
    }
}

Submission Info

Judge Result