Submission #3600338

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int x[100010];

int main(){
	int n, k;
	cin >> n >> k;
	for(int i=0; i<n; i++) cin >> x[i];

	for(int i=1; i<=n-k+1; i++){
		int ans[i+k-1];
		for(int j=0; j<i+k-1; j++) ans[j] = x[j];
		sort(ans, ans+i+k-1);
		for(int j=0; j<i+k-1; j++){
			if(x[j] == ans[k-1]) cout << j+1 << endl;
		}
	}
}

Submission Info

Judge Result