125972024-12-26 16:43:35ruffbrigiFasor (40)cpp17Wrong answer 24/4086ms3380 KiB
#include <iostream>
#include <vector>
#include <set>

using namespace std;

int main()
{
    int n,k,x,ul=0,szb,szj;
    vector<int> magassagok;
    cin>>n>>k;
    szb=-k;
    szj=k;
    set<int> latokor;
    for(int i=0;i<=n-1;i++)
    {
        cin>>x;
        magassagok.push_back(x);
        if(i<=k) latokor.insert(x);
    }
    bool boldog=false;
    while(!boldog && ul<=n-1)
    {
        auto last = prev(latokor.end());
        if(magassagok[ul]==*last) boldog=true;
        else ul++;
    }
    if(boldog) cout<<ul+1;
    else cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base24/40
1Accepted0/01ms320 KiB
2Wrong answer0/04ms500 KiB
3Accepted2/21ms320 KiB
4Wrong answer0/21ms332 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Accepted2/21ms408 KiB
8Wrong answer0/21ms320 KiB
9Accepted2/24ms512 KiB
10Wrong answer0/24ms320 KiB
11Wrong answer0/24ms508 KiB
12Accepted2/23ms356 KiB
13Wrong answer0/237ms984 KiB
14Accepted2/234ms1040 KiB
15Accepted2/257ms1544 KiB
16Accepted2/267ms1488 KiB
17Accepted2/272ms1536 KiB
18Wrong answer0/271ms1512 KiB
19Wrong answer0/271ms1436 KiB
20Accepted2/221ms976 KiB
21Accepted2/259ms1452 KiB
22Accepted2/286ms3380 KiB