Submission #12,667

2024-12-27 19:58:49

cpp17

Wrong answer 28/40

75ms

560 KiB

#include <iostream>

using namespace std;

int main()
{
    int N, K, db=0, sorsz=1, x, elso;
    bool boldog=false;
    cin >> N >> K;
    cin >> elso;
    for (int i=2; i<=N && !boldog; i++)
    {
        cin >> x;
        if (x>elso)
        {
            db=0;
            elso=x;
            sorsz=i;
            //cout << sorsz << endl;
        }
        else db++;
        //cout << db << endl;
        if (db>K) boldog=true;
    }
    if (boldog) {cout << sorsz;}
    else cout << -1;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	28/40
		1	Wrong answer	0/0	1ms	508 KiB
		2	Accepted	0/0	1ms	320 KiB
		3	Accepted	2/2	1ms	320 KiB
		4	Wrong answer	0/2	1ms	320 KiB
		5	Accepted	2/2	1ms	320 KiB
		6	Wrong answer	0/2	1ms	320 KiB
		7	Accepted	2/2	1ms	560 KiB
		8	Accepted	2/2	1ms	320 KiB
		9	Accepted	2/2	1ms	320 KiB
		10	Accepted	2/2	1ms	352 KiB
		11	Accepted	2/2	1ms	320 KiB
		12	Accepted	2/2	1ms	324 KiB
		13	Accepted	2/2	35ms	400 KiB
		14	Wrong answer	0/2	34ms	400 KiB
		15	Accepted	2/2	39ms	508 KiB
		16	Accepted	2/2	32ms	400 KiB
		17	Accepted	2/2	45ms	508 KiB
		18	Wrong answer	0/2	75ms	400 KiB
		19	Accepted	2/2	35ms	512 KiB
		20	Wrong answer	0/2	21ms	400 KiB
		21	Wrong answer	0/2	59ms	500 KiB
		22	Accepted	2/2	32ms	408 KiB