Submission #1671364

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
int go[200000] = {};
int done[200000] = {};
int main() {
	int n, k;
	cin >> n >> k;
	vector<pair<int, int>> wow;
	REP(i, n) {
		int tmp;
		cin >> tmp;
		wow.push_back(make_pair(tmp, i));
	}
	sort(wow.begin(), wow.end());
	for (int i = 0;i < wow.size();++i) {
		go[wow[i].second] = i;
	}
	int hoge = k-1;
	vector<int> answers;
	answers.push_back(wow[hoge].second);
	for (int i = n - 1;i >= k;--i) {
		done[go[i]] = true;
		if (go[i] <= hoge) {
			while (true) {
				hoge++;
				if (done[hoge] == false) break;
			}
		}
		answers.push_back(wow[hoge].second);
	}
	REP(i, answers.size()) {
		cout << answers[answers.size() - 1 - i]+1 << endl;
	}
	return 0;
}

Submission Info

Judge Result