1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>  

using namespace std;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    long long n;
    cin >> n;

    vector<pair<long long, long long>> k;  

    string word;
    long long liczba;

    for (long long i = 0; i < n; i++) {
        cin >> word >> liczba;
        if (word == "TAK") {
            k.push_back({ i + 1, liczba });
        }
    }

    vector<long long> f; 
    for (long long i = 0; i < k.size() && f.size() < 10; i++) {
        f.push_back(k[i].first);
    }
    for (long long i = 10; i < k.size() && f.size() < 20; i++) {
        if (k[i].second < 2) {
            f.push_back(k[i].first);
        }
    }
    sort(f.begin(), f.end());
    for (long long i = 0; i < f.size(); i++) {
        cout << f[i] << " ";
    }

    return 0;
}