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
44
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define Q queue
#define PQ priority_queue
#define ST stack
#define UMAP unordered_map
typedef long long LL;
typedef pair<int, int> PII;
typedef V<int> VI;
typedef V<V<int>> VVI;

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

    int n;
    cin >> n;
    VI fin;
    VI fin_cnt(n, 0);
    VI want_fin(n, false);
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        int cnt;
        cin >> cnt;
        fin_cnt[i] = cnt;
        want_fin[i] = (s == "TAK" ? 1 : 0);
    }
    for (int i = 0; i < n; ++i) {
        if (fin.size() == 20)
            break;
        if (want_fin[i] && (fin.size() < 10 || fin_cnt[i] < 2)) {
            fin.push_back(i+1);
        }
    }
    for (int i = 0; i < fin.size(); ++i) {
        cout << fin[i] << ' ';
    }
    cout << '\n';

    return 0;
}