题解

#include <iostream>
#include <queue>
using namespace std;
int q[501], n, maxx, h, t, a;
long long k, cnt;

int main() {
	cin >> n >> k >> a;
	maxx = a;
	for (int i = 1; i < n; i++) {
		int x;
		cin >> x;
		q[t++] = x;
		maxx = max(maxx, x);
	}
	if (k > n) {
		cout << maxx;
	} else {
		while (cnt != k) {
			if (a > q[h]) {
				cnt++;
				q[t++] = q[h++];
			} else {
				cnt = 0;
				a = q[h++];
			}
		}
		cout << a;
	}
	return 0;
}