126012024-12-26 17:14:57PappMatyasProgramtermék verseny (70 pont)cpp17Wrong answer 47/7035ms696 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k, S[100000], higher = 0;
    int g = 0, s = 0, b = 0;
    cin >> n >> k;
    k--;
    for(int i = 0; i < n; i++)
    {
        cin >> S[i];
    }
    for(int i = 0; i < k; i++)
    {
        if(S[i] >= S[k])
        {
            higher++;
        }
    }
    for(int i = k + 1; i < n; i++)
    {
        if(S[i] >= S[k])
        {
            higher++;
        }
        if(higher == n/12)
        {
            g = i;
        }
        else if(higher == n/4)
        {
            s = i;
        }
        else if(higher == n/2)
        {
            b = i;
        }
    }
    if(higher < n / 12)
    {
        g = n;
    }
    else if(higher < n / 4)
    {
        s = n;
    }
    else if(higher < n / 2)
    {
        b = n;
    }
    cout << g << endl << s << endl << b << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base47/70
1Accepted0/01ms320 KiB
2Accepted0/01ms500 KiB
3Wrong answer0/035ms568 KiB
4Accepted3/31ms320 KiB
5Accepted3/31ms320 KiB
6Wrong answer0/31ms320 KiB
7Accepted3/31ms320 KiB
8Wrong answer0/31ms320 KiB
9Wrong answer0/31ms320 KiB
10Wrong answer0/31ms508 KiB
11Accepted3/31ms320 KiB
12Accepted3/31ms320 KiB
13Wrong answer0/32ms320 KiB
14Wrong answer0/42ms500 KiB
15Wrong answer0/417ms564 KiB
16Accepted4/420ms480 KiB
17Accepted4/425ms560 KiB
18Accepted4/44ms320 KiB
19Accepted4/47ms320 KiB
20Accepted4/410ms512 KiB
21Accepted4/435ms696 KiB
22Accepted4/435ms568 KiB
23Accepted4/432ms536 KiB