229602026-01-16 09:43:11PKBProgramtermék verseny (70 pont)cpp17Accepted 70/7014ms820 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<int> P(N+1);
    for (int i = 1; i <= N; i++) cin >> P[i];

    int B = P[K];

    int arany = N / 12;
    int ezust = N / 4;
    int bronz = N / 2;

    int jobb = 0;
    int lastA = 0, lastE = 0, lastB = 0;

    for (int i = 1; i <= N; i++) {
        if (i != K && P[i] > B) jobb++;

        if (i >= K) {
            int hely = jobb + 1;

            if (hely <= arany) {
                lastA = i;
            }
            else if (hely <= ezust) {
                lastE = i;
            }
            else if (hely <= bronz) {
                lastB = i;
            }
        }
    }

    cout << lastA << "\n" << lastE << "\n" << lastB << "\n";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/013ms820 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms508 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms556 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted4/42ms508 KiB
15Accepted4/48ms564 KiB
16Accepted4/48ms564 KiB
17Accepted4/49ms564 KiB
18Accepted4/42ms464 KiB
19Accepted4/43ms316 KiB
20Accepted4/44ms316 KiB
21Accepted4/413ms820 KiB
22Accepted4/414ms820 KiB
23Accepted4/412ms680 KiB