Submission #1225956

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int A[100001],B[100001];

int main()
{
	int N, K;  cin >> N >> K;
	priority_queue<int> a;

	for (int i = 1; i <= N; i++) {
		cin >> A[i];
		B[A[i]] = i;
		if (i <= K - 1)a.push(A[i]);
	}

		for (int i = 1; i <= N - K + 1; i++) {
			cout << B[N - i + 1] << endl;
		}
	
	return 0;
}

Submission Info

Judge Result