Submission #23,583

2026-01-25 17:32:26

cpp17

Wrong answer 38/40

71ms

2036 KiB

#include <iostream>
#include<bits/stdc++.h>

using namespace std;

int main()
{
    int jelenlegi=0;
    int n,k;
    cin>>n>>k;
    vector<long long>fasor(n);
        for (int i=0; i<n; i++){
            cin>>fasor[i];
        }
    for(int i=jelenlegi+1; i<=jelenlegi+k&&i<n; i++){
                if(fasor[i]>fasor[jelenlegi]){
                jelenlegi=i;
                i=jelenlegi+1;

            }

    }
   cout<<jelenlegi+1;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	38/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	316 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Wrong answer	0/2	1ms	316 KiB
		5	Accepted	2/2	1ms	556 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	2/2	2ms	316 KiB
		9	Accepted	2/2	4ms	316 KiB
		10	Accepted	2/2	4ms	508 KiB
		11	Accepted	2/2	4ms	316 KiB
		12	Accepted	2/2	3ms	508 KiB
		13	Accepted	2/2	37ms	1188 KiB
		14	Accepted	2/2	34ms	1056 KiB
		15	Accepted	2/2	57ms	1844 KiB
		16	Accepted	2/2	65ms	1844 KiB
		17	Accepted	2/2	71ms	1844 KiB
		18	Accepted	2/2	71ms	2036 KiB
		19	Accepted	2/2	71ms	1844 KiB
		20	Accepted	2/2	21ms	1196 KiB
		21	Accepted	2/2	59ms	1844 KiB
		22	Accepted	2/2	71ms	1976 KiB