Submission #22,346

2026-01-14 21:49:02

cpp17

Wrong answer 10/40

71ms

1172 KiB

#include <iostream>
#include <fstream>
using namespace std;
int n;
int k;
int a[200000];
int j=0;
void ki(int y){
    if(y!=0) cout<<y+1;
    else cout<<-1;
}
void moz(){
    int i=1;
    cin>>n>>k;
    int k1=k;
    for(int x=0; x<n; x++) cin>>a[x];
    while(i<n && k1>=0){
        if(a[i]>=a[j]) {j=i; k1=k;}
        k1--;
        i++;
    }
}
int main()
{   moz();
    ki(j);
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	10/40
		1	Wrong answer	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	316 KiB
		3	Wrong answer	0/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Wrong answer	0/2	1ms	316 KiB
		8	Accepted	2/2	3ms	316 KiB
		9	Wrong answer	0/2	4ms	416 KiB
		10	Accepted	2/2	4ms	380 KiB
		11	Wrong answer	0/2	4ms	316 KiB
		12	Wrong answer	0/2	3ms	412 KiB
		13	Wrong answer	0/2	35ms	756 KiB
		14	Wrong answer	0/2	32ms	728 KiB
		15	Wrong answer	0/2	54ms	1072 KiB
		16	Wrong answer	0/2	64ms	1068 KiB
		17	Wrong answer	0/2	71ms	1072 KiB
		18	Wrong answer	0/2	71ms	1124 KiB
		19	Wrong answer	0/2	71ms	948 KiB
		20	Wrong answer	0/2	20ms	564 KiB
		21	Wrong answer	0/2	57ms	1172 KiB
		22	Accepted	2/2	70ms	976 KiB