题解

#include <bits/stdc++.h>
#include<queue> 
using namespace std;
queue<long long>q;
long long a[100001]; 
int main(){
	long long n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		q.push(a[i]);
	}
	int first_num=q.front();
	q.pop();
	int cnt=1;
	while(cnt<=k){
		if(first_num>q.front()){
			cnt++;
			q.push(q.front());//将队头的元素插入到队尾
			q.pop(); 
		}
		else if(first_num<q.front()){
			cnt=1;
			q.push(first_num);
			first_num=q.front();
			q.pop();
		}
	}
	cout<<first_num;
	return 0;
}