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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
using namespace std;

const int MAX_N = 10000; 

int main() {
    int n;
    cin >> n;

    string status[MAX_N]; 
    int x[MAX_N];      

   
    for (int i = 0; i < n; ++i) {
        cin >> status[i] >> x[i];
    }

    int finalists[20]; 
    int count = 0;    

    
    for (int i = 0; i < n && count < 10; ++i) {
        if (status[i] == "TAK") {
            finalists[count++] = i + 1; 
        }
    }

    
    for (int i = 0; i < n && count < 20; ++i) {
        if (status[i] == "TAK" && x[i] < 2) {
            
            bool already_selected = false;
            for (int j = 0; j < 10; ++j) {
                if (finalists[j] == i + 1) {
                    already_selected = true;
                    break;
                }
            }
            if (!already_selected) {
                finalists[count++] = i + 1;
            }
        }
    }

    
    for (int i = 0; i < 20; ++i) {
        for (int j = i + 1; j < 20; ++j) {
            if (finalists[i] > finalists[j]) {
                
                int temp = finalists[i];
                finalists[i] = finalists[j];
                finalists[j] = temp;
            }
        }
    }

    
    for (int i = 0; i < 20; ++i) {
        cout << finalists[i] << " ";
    }
    cout << endl;

    return 0;
}