Submission #22,338

2026-01-14 21:38:54

cpp17

Wrong answer 8/40

71ms

1136 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;
    int k1=k;
    cin>>n>>k;
    for(int j=0; j<n; j++) cin>>a[j];
    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	8/40
		1	Wrong answer	0/0	1ms	316 KiB
		2	Wrong answer	0/0	4ms	316 KiB
		3	Wrong answer	0/2	1ms	316 KiB
		4	Accepted	2/2	1ms	500 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Accepted	2/2	1ms	500 KiB
		7	Wrong answer	0/2	1ms	316 KiB
		8	Accepted	2/2	2ms	324 KiB
		9	Wrong answer	0/2	4ms	424 KiB
		10	Accepted	2/2	4ms	348 KiB
		11	Wrong answer	0/2	4ms	332 KiB
		12	Wrong answer	0/2	3ms	316 KiB
		13	Wrong answer	0/2	35ms	720 KiB
		14	Wrong answer	0/2	32ms	776 KiB
		15	Wrong answer	0/2	54ms	1056 KiB
		16	Wrong answer	0/2	64ms	996 KiB
		17	Wrong answer	0/2	70ms	1072 KiB
		18	Wrong answer	0/2	71ms	1068 KiB
		19	Wrong answer	0/2	70ms	1136 KiB
		20	Wrong answer	0/2	20ms	580 KiB
		21	Wrong answer	0/2	54ms	1076 KiB
		22	Wrong answer	0/2	68ms	1056 KiB