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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct cli
{
	int l;
	int i;
};

int const MAX_N = 10'000;
vector<cli> tab;
vector<int> winners;

int main()
{
	std::ios_base::sync_with_stdio(0); 
	cin.tie(0);
	cout.tie(0);

	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		string a;
		int b;
		cin >> a >> b;
		bool A = 0;
		if (a == "TAK")
		{
			tab.push_back({ b,i });
		}
	}

	int l = 10;

	for (int i = 0; i < tab.size(); i++)
	{
		if (l != 0)
		{
			winners.push_back(tab[i].i);
			l--;
		}
		else
		{
			if (tab[i].l < 2) winners.push_back(tab[i].i);
		}
	}
	for (int i = 0; i<20; i++)
	{
		cout << winners[i] << " ";
	}
}