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
65
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pii pair<int, int>
#define fi first
#define se second


void solve(){
	
	int n;
	cin >> n;
	
	queue<pair<int, int>> q;
	
	for(int i = 1; i <= n; i++){
		
		string s; cin >> s;	
		int x; cin >> x;		
		if(s == "TAK") q.push({x, i});
	}
	
	vector<int> v;
	int ile = 10;
	
	while(ile--){
		
		v.push_back(q.front().se);
		q.pop();
	}
	
	ile = 10;
	while(ile > 0){
		
		if(q.front().fi < 2){
			
			v.push_back(q.front().se);
			ile--;
		}
		q.pop();
	} 
	
	for(auto u : v) cout << u << ' ';
	cout << '\n'; 
	
	
	
}

bool multi = 0;

signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	int t = 1;
	if(multi) cin >> t;
	while(t--) solve();
	
	return 0;
}