177032025-09-16 15:33:11algoproFasor (40)cpp17Wrong answer 2/4072ms1268 KiB
// UUID: 3cf99e70-7bec-411e-9e52-846bdbe2fa8d
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,k;
	cin>>n>>k;
	vector<int>v(n);
	for(int i=0;i<n;i++){
		cin>>v[i];
	}
	int a=0,i=1;
	while (i>0&&i<n-k){
		int b=a;
		for(int j=1;j<k+1;j++){
			if(v[a]<=v[j]){
				a=j;
				break;
			}
		}
		if(b==a){
			cout<<a+1;
			i= -1;
		}else{
			i++;
		}
	}
	if(i>-1){
		int d=0;
		for(int h=0;h<k;h++){
			if (d<v[i+h]){
				d=v[i+h];
			}
			//cout<<d<<"\n";
		}
		cout<<d+1;
	}
}
SubtaskSumTestVerdictTimeMemory
base2/40
1Accepted0/01ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms316 KiB
9Accepted2/24ms508 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/24ms432 KiB
12Wrong answer0/23ms352 KiB
13Wrong answer0/237ms564 KiB
14Runtime error0/234ms808 KiB
15Wrong answer0/257ms1196 KiB
16Wrong answer0/267ms1192 KiB
17Wrong answer0/272ms1076 KiB
18Wrong answer0/272ms1196 KiB
19Wrong answer0/272ms1076 KiB
20Wrong answer0/221ms800 KiB
21Wrong answer0/259ms1076 KiB
22Wrong answer0/271ms1268 KiB