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
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <stack>
#include <unordered_map>
#include <iomanip>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>

using namespace std;
bool sortowanie(pair<string,int> b,pair<string,int> a){

return a.second>b.second;}




int main(){
int a,c;
string b;
cin>>a;
vector<int> v;
vector<pair<int,int>> pary2;
v.resize(a);
pary2.resize(a);
int f;
int j=0;
for(int i=0;i<a;i++){
    cin>>b;    
    if(b=="TAK"){
        cin>>pary2[j].second;
        pary2[j].first=i+1;
        j++;
        continue;}
        
        cin>>f;}

for(int i=0;i<10;i++){
cout<<pary2[i].first<<' ';
pary2[i].second=10;}
    c=0;
for(int i=0;i<a;i++){
if(c>=10){
    i=a;
    continue;}
    if(pary2[i].second<2){
        cout<<pary2[i].first<<' ';
        c++;}}








    
    

return 0;}