210422026-01-12 09:46:41sklausFasor (40)cpp17Wrong answer 34/4070ms1092 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k;
    cin>>n>>k;
    int t[n];
    for(int i=0; i<n; i++)cin>>t[i];
    int pos=0;
    for(int i=1; i<=k; i++)
    {
        if(t[pos+i]>t[pos])
        {pos=pos+i;
        i=1;
        }
    }
    cout<<pos+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms500 KiB
11Accepted2/24ms408 KiB
12Accepted2/23ms332 KiB
13Accepted2/235ms760 KiB
14Runtime error0/234ms820 KiB
15Accepted2/254ms1068 KiB
16Accepted2/264ms1036 KiB
17Accepted2/270ms1092 KiB
18Accepted2/270ms1080 KiB
19Accepted2/270ms1076 KiB
20Runtime error0/221ms652 KiB
21Accepted2/257ms1076 KiB
22Accepted2/270ms1076 KiB