Submission #22,351

2026-01-14 21:53:12

cpp17

Wrong answer 16/40

74ms

1104 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 && (i-j)<=k1+1){
        if(a[i]>a[j]) {j=i; k1=k;}
        k1--;
        i++;
    }
}
int main()
{   moz();
    ki(j);
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	16/40
		1	Wrong answer	0/0	1ms	316 KiB
		2	Wrong answer	0/0	4ms	316 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Wrong answer	0/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Wrong answer	0/2	1ms	380 KiB
		9	Wrong answer	0/2	4ms	316 KiB
		10	Wrong answer	0/2	4ms	316 KiB
		11	Wrong answer	0/2	4ms	316 KiB
		12	Accepted	2/2	3ms	316 KiB
		13	Wrong answer	0/2	37ms	784 KiB
		14	Accepted	2/2	34ms	620 KiB
		15	Accepted	2/2	59ms	964 KiB
		16	Wrong answer	0/2	67ms	1088 KiB
		17	Accepted	2/2	74ms	996 KiB
		18	Wrong answer	0/2	74ms	1096 KiB
		19	Wrong answer	0/2	72ms	1104 KiB
		20	Wrong answer	0/2	21ms	564 KiB
		21	Wrong answer	0/2	59ms	1076 KiB
		22	Accepted	2/2	72ms	1092 KiB