178932025-09-22 17:49:35algoproFasor (40)cpp17Wrong answer 0/4071ms2076 KiB
// UUID: 1c49b160-ed8c-48a1-ac2a-ed511ae7ba0f
#include <bits/stdc++.h>
using namespace std;

int main() {
	long long n;
	long long k;
	cin>>n>>k;
	vector<long long>v(n);
	for(int i=0;i<n;i++){
		cin>>v[i];
	
	}

	long long chosen=0;
	bool x=true;
	while(x){
		x=false;
		for (int j=1; j<=k; j++){
			
			if (chosen+j<n && v[chosen]<v[chosen+j]){
				chosen=chosen+j;
				x=true;
				
				break;
			}
		}

		}
		
	cout << v[chosen+1];}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms316 KiB
9Wrong answer0/24ms472 KiB
10Wrong answer0/24ms480 KiB
11Wrong answer0/24ms508 KiB
12Wrong answer0/23ms476 KiB
13Wrong answer0/237ms1236 KiB
14Wrong answer0/235ms1076 KiB
15Wrong answer0/257ms2036 KiB
16Wrong answer0/265ms2076 KiB
17Wrong answer0/271ms1844 KiB
18Wrong answer0/271ms1844 KiB
19Wrong answer0/271ms1844 KiB
20Wrong answer0/221ms1268 KiB
21Wrong answer0/259ms1844 KiB
22Wrong answer0/271ms1844 KiB