197342025-12-20 17:53:59GergoszaboProgramtermék verseny (70 pont)cpp17Wrong answer 16/7035ms1076 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 (ranking <= n/12) g = i;
//        else if (ranking <= n/4) s = i;
//        else if (ranking <= n/2) b = i;
        if (v[i] > v[k]) ranking++;
    }
    for (ll i = k+1; i <= n; i++){
        if (ranking <= n/12) g = i;
        else if (ranking <= n/4) s = i;
        else if (ranking <= n/2) b = i;
        if (v[i] > v[k]) ranking++;
    }
    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;
}
SubtaskSumTestVerdictTimeMemory
base16/70
1Wrong answer0/01ms316 KiB
2Accepted0/01ms316 KiB
3Wrong answer0/035ms1076 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms372 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/31ms412 KiB
11Wrong answer0/31ms400 KiB
12Wrong answer0/32ms344 KiB
13Wrong answer0/32ms316 KiB
14Wrong answer0/42ms508 KiB
15Wrong answer0/418ms800 KiB
16Wrong answer0/421ms880 KiB
17Wrong answer0/425ms788 KiB
18Wrong answer0/44ms316 KiB
19Wrong answer0/48ms564 KiB
20Accepted4/410ms564 KiB
21Wrong answer0/435ms1076 KiB
22Wrong answer0/435ms1076 KiB
23Wrong answer0/432ms1076 KiB