219452026-01-14 11:02:20AsuraFasor (40)cpp17Time limit exceeded 20/40300ms3124 KiB
#include <iostream>
#include <vector>
#include <set>

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];

    set<int,greater<int>>s;
    int i=0, p;
    while(i<n){
        p=i+k;
        for(int j=i; j<=p; j++)
            s.insert(f[j]);
        if(f[i]==*s.begin()){
            cout<<i+1;
            return 0;
        }
        i++;
    }
    cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base20/40
1Accepted0/01ms316 KiB
2Accepted0/04ms432 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms336 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms316 KiB
12Accepted2/23ms500 KiB
13Time limit exceeded0/2300ms564 KiB
14Runtime error0/235ms800 KiB
15Time limit exceeded0/2300ms1076 KiB
16Time limit exceeded0/2300ms1296 KiB
17Time limit exceeded0/2284ms1076 KiB
18Time limit exceeded0/2286ms1260 KiB
19Time limit exceeded0/2287ms1076 KiB
20Time limit exceeded0/2289ms760 KiB
21Time limit exceeded0/2291ms1076 KiB
22Time limit exceeded0/2282ms3124 KiB