Submission #223824

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main(){
	int N;
	int K;

	cin >> N >> K;

	vector<int> X(N);
	for(int i = 0;i<N;i++)
		cin >> X[i];

	for(int i = K ;i < N + 1;i++){
		vector<int> Y = X;
		sort(Y.begin(),Y.begin()+i);
		for(int j = 0;j < N;j++){
			if(X[j] == Y[K - 1]){
				cout << j + 1 <<endl;
				break;
			}
		}
	}



	return 0;
}

Submission Info

Judge Result