143312025-01-10 16:22:21bzyProgramtermék verseny (70 pont)cpp17Wrong answer 67/7039ms804 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;
            }
            if(more >= n/4 && ezust == 0)
            {
                if(i > k) ezust = i-1;
            }
            if(more >= n/2 && bronz == 0)
            {
                if(i > k) bronz = i-1;
            }
        }

    }
    if(more < n/12) arany = n;
    else if(more < n/4) ezust = n;
    else if(more < n/2) bronz = n;
    cout << arany << endl << ezust << endl << bronz;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base67/70
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted0/037ms564 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms508 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/32ms328 KiB
13Accepted3/32ms328 KiB
14Accepted4/42ms508 KiB
15Accepted4/418ms568 KiB
16Accepted4/421ms648 KiB
17Accepted4/427ms564 KiB
18Accepted4/44ms316 KiB
19Accepted4/47ms316 KiB
20Accepted4/410ms508 KiB
21Accepted4/439ms796 KiB
22Accepted4/437ms804 KiB
23Accepted4/432ms760 KiB