143322025-01-10 16:26:42bzyProgramtermék verseny (70 pont)cpp17Accepted 70/7035ms812 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll  long long

int main()
{
    int n, k; cin >> n >> k;
    vector <int> P(n+1);
    for(int i = 1; i <= n; i++) cin >> P[i];
    int own = P[k];
    int more = 0;
    int arany = 0;
    int ezust = 0;
    int bronz = 0;
    for(int i = 1; i <= n; i++)
    {
        if(P[i] > own) more++;
        if(i >= k)
        {
            if(more >= n/12 && arany == 0)
            {
                if(i > k) arany = i-1;
                else arany = -1;
            }
            if(more >= n/4 && ezust == 0)
            {
                if(i > k) ezust = i-1;
                else ezust = -1;
            }
            if(more >= n/2 && bronz == 0)
            {
                if(i > k) bronz = i-1;
                else bronz = -1;
            }
        }

    }
    if(more < n/12) arany = n;
    else if(more < n/4) ezust = n;
    else if(more < n/2) bronz = n;
    if(arany == -1) arany = 0;
    if(ezust == -1) ezust = 0;
    if(bronz == -1) bronz = 0;
    cout << arany << endl << ezust << endl << bronz;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/035ms812 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/32ms316 KiB
12Accepted3/32ms316 KiB
13Accepted3/32ms316 KiB
14Accepted4/42ms316 KiB
15Accepted4/417ms756 KiB
16Accepted4/421ms644 KiB
17Accepted4/425ms688 KiB
18Accepted4/44ms316 KiB
19Accepted4/47ms476 KiB
20Accepted4/410ms512 KiB
21Accepted4/435ms804 KiB
22Accepted4/435ms800 KiB
23Accepted4/432ms752 KiB