Submission #10,892

2024-04-18 09:26:39

cpp17

Wrong answer 34/40

76ms

6372 KiB

#include <iostream>
#include <queue>
#define ll long long

using namespace std;

int main()
{
    ll n, k;
    cin >> n >> k;
    vector <ll> x(n + 1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> x[i];
    }
    ll j = 1, poz = -1;
    for (ll i = j + 1; i <= k + j; ++i)
    {
        if (x[j] < x[i])
        {
            poz = i;
            j = i;
        }
    }
    cout << poz;

    return 0;
}
/*
10 3
6 2 1 8 4 8 7 12 9 3
*/

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	4ms	2136 KiB
		3	Accepted	2/2	3ms	2228 KiB
		4	Accepted	2/2	3ms	2260 KiB
		5	Wrong answer	0/2	3ms	2496 KiB
		6	Accepted	2/2	3ms	2736 KiB
		7	Accepted	2/2	3ms	2640 KiB
		8	Accepted	2/2	3ms	2836 KiB
		9	Wrong answer	0/2	4ms	3256 KiB
		10	Accepted	2/2	6ms	3184 KiB
		11	Accepted	2/2	6ms	3188 KiB
		12	Accepted	2/2	4ms	3152 KiB
		13	Accepted	2/2	39ms	4432 KiB
		14	Runtime error	0/2	34ms	4808 KiB
		15	Accepted	2/2	57ms	5988 KiB
		16	Accepted	2/2	70ms	5992 KiB
		17	Accepted	2/2	76ms	5988 KiB
		18	Accepted	2/2	71ms	5988 KiB
		19	Accepted	2/2	71ms	6248 KiB
		20	Accepted	2/2	24ms	4768 KiB
		21	Accepted	2/2	59ms	6372 KiB
		22	Accepted	2/2	71ms	6372 KiB