Submission #23,579

2026-01-25 17:03:26

cpp17

Wrong answer 22/40

71ms

1272 KiB

#include <iostream>
#include<bits/stdc++.h>

using namespace std;

int main()
{
    int jelenlegi=0;
    int n,k;
    cin>>n>>k;
    vector<int>fasor(n);
        for (int i=0; i<n; i++){
            cin>>fasor[i];
        }
    for(int i=jelenlegi+1; i<=k; i++){
        if(fasor[i]>fasor[jelenlegi]){
            jelenlegi=i;
        }
    }
   cout<<jelenlegi+1;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	22/40
		1	Accepted	0/0	1ms	508 KiB
		2	Wrong answer	0/0	3ms	316 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Wrong answer	0/2	1ms	500 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Wrong answer	0/2	1ms	508 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Wrong answer	0/2	2ms	408 KiB
		9	Accepted	2/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	35ms	568 KiB
		14	Runtime error	0/2	34ms	804 KiB
		15	Accepted	2/2	54ms	1076 KiB
		16	Accepted	2/2	65ms	1196 KiB
		17	Accepted	2/2	71ms	1132 KiB
		18	Wrong answer	0/2	71ms	1076 KiB
		19	Wrong answer	0/2	71ms	1076 KiB
		20	Accepted	2/2	20ms	564 KiB
		21	Accepted	2/2	56ms	1076 KiB
		22	Accepted	2/2	71ms	1272 KiB