134552025-01-08 07:44:38GundischBalazsFasor (40)cpp17Wrong answer 4/4045ms508 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k,maxi,db=0,x,i=2,mi=0;
    cin >> n >> k;
    cin >> x;
    maxi = x;
   while(i <= n){
        cin >> x;
        if(x > maxi){
            maxi = x;
            mi = i;
            db=0;
        }
        else{
            db++;
        }
        if(db==k){
            cout << mi+1;
            return 0;
        }
        i++;
    }
    cout << -1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/40
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms508 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms396 KiB
12Wrong answer0/21ms376 KiB
13Wrong answer0/235ms400 KiB
14Wrong answer0/234ms400 KiB
15Wrong answer0/239ms408 KiB
16Wrong answer0/232ms508 KiB
17Wrong answer0/243ms316 KiB
18Wrong answer0/234ms316 KiB
19Wrong answer0/234ms316 KiB
20Wrong answer0/221ms316 KiB
21Wrong answer0/245ms500 KiB
22Wrong answer0/232ms396 KiB