Submission #22,390

2026-01-14 22:53:58

cpp17

Wrong answer 36/40

71ms

1132 KiB

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

	Sum	Test	Verdict		Time	Memory
base	36/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	508 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Accepted	2/2	1ms	500 KiB
		7	Accepted	2/2	1ms	376 KiB
		8	Accepted	2/2	2ms	316 KiB
		9	Wrong answer	0/2	4ms	316 KiB
		10	Accepted	2/2	4ms	432 KiB
		11	Accepted	2/2	4ms	432 KiB
		12	Accepted	2/2	3ms	368 KiB
		13	Accepted	2/2	35ms	744 KiB
		14	Accepted	2/2	32ms	668 KiB
		15	Accepted	2/2	54ms	1128 KiB
		16	Accepted	2/2	64ms	1076 KiB
		17	Accepted	2/2	70ms	1080 KiB
		18	Accepted	2/2	70ms	996 KiB
		19	Accepted	2/2	71ms	1076 KiB
		20	Accepted	2/2	20ms	564 KiB
		21	Accepted	2/2	56ms	1032 KiB
		22	Accepted	2/2	68ms	1132 KiB