Submission #22,348

2026-01-14 21:50:27

cpp17

Wrong answer 12/40

75ms

1160 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)>=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	12/40
		1	Wrong answer	0/0	1ms	500 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	2ms	508 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	576 KiB
		14	Accepted	2/2	34ms	572 KiB
		15	Wrong answer	0/2	59ms	1052 KiB
		16	Wrong answer	0/2	67ms	1160 KiB
		17	Wrong answer	0/2	75ms	1076 KiB
		18	Wrong answer	0/2	74ms	996 KiB
		19	Wrong answer	0/2	74ms	1020 KiB
		20	Accepted	2/2	21ms	616 KiB
		21	Wrong answer	0/2	59ms	1076 KiB
		22	Wrong answer	0/2	74ms	1076 KiB