Submission #19,732

19732

2025-12-20 17:32:00

cpp17

Wrong answer 67/70

39ms

1840 KiB

#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n, k; cin >> n >> k;
    vector<ll> v(n+1, 0);
    for (ll i = 1; i <= n; i++){
        cin >> v[i];
    }
    ll ranking = 1;
    ll g = 0, s = 0, b = 0;
    for (ll i = 1; i < k; i++){
        if (v[i] > v[k]) ranking++;
    }
    for (ll i = k+1; i <= n; i++){
        if (v[i] > v[k]) ranking++;
        if (ranking <= n/12) g = i;
        else if (ranking <= n/4) s = i;
        else if (ranking <= n/2) b = i;
    }
    if (ranking <= n/12) g = n;
    else if (ranking <= n/4) s = n;
    else if (ranking <= n/2) b = n;
    cout << g << "\n" << s << "\n" << b;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	67/70
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	39ms	1840 KiB
		4	Accepted	3/3	1ms	508 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Wrong answer	0/3	1ms	564 KiB
		10	Accepted	3/3	1ms	536 KiB
		11	Accepted	3/3	1ms	564 KiB
		12	Accepted	3/3	2ms	316 KiB
		13	Accepted	3/3	2ms	316 KiB
		14	Accepted	4/4	2ms	508 KiB
		15	Accepted	4/4	18ms	1076 KiB
		16	Accepted	4/4	21ms	1160 KiB
		17	Accepted	4/4	27ms	1352 KiB
		18	Accepted	4/4	4ms	536 KiB
		19	Accepted	4/4	8ms	684 KiB
		20	Accepted	4/4	10ms	832 KiB
		21	Accepted	4/4	37ms	1820 KiB
		22	Accepted	4/4	37ms	1824 KiB
		23	Accepted	4/4	34ms	1588 KiB