219222026-01-14 10:25:57AsuraFasor (40)cpp17Wrong answer 18/40300ms1328 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin>>n>>k;
    vector<int>f(n);
    for(int i=0; i<n; i++)
        cin>>f[i];

    bool nincsjobb=false;
    int j=0, p=k;
    while(!nincsjobb&&p<n){
        nincsjobb=true;
        for(int i=j+1; i<=p; i++){
            if(f[j]<f[i])
                nincsjobb=false;
        }
        p++;
        j++;
    }
    if(!nincsjobb){
        for(int i=j; i<n; i++){
            if(f[j]<f[i]){
                j=i;
                nincsjobb=true;
            }
        }
        if(nincsjobb)
            cout<<j;
        else
            cout<<-1;
    }
    else
        cout<<j;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base18/40
1Accepted0/01ms316 KiB
2Accepted0/04ms508 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms400 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms316 KiB
12Accepted2/23ms316 KiB
13Time limit exceeded0/2298ms564 KiB
14Wrong answer0/232ms564 KiB
15Time limit exceeded0/2298ms1020 KiB
16Time limit exceeded0/2300ms1076 KiB
17Time limit exceeded0/2286ms1076 KiB
18Time limit exceeded0/2287ms1076 KiB
19Time limit exceeded0/2289ms1328 KiB
20Time limit exceeded0/2289ms564 KiB
21Time limit exceeded0/2300ms1076 KiB
22Time limit exceeded0/2282ms1076 KiB