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
66
67
68
69
70
71
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int top[20];
    const int peoples = 10000;
    int amount;
    string yn[peoples];
    int score[peoples];

    cin >> amount;

    for (int i = 0; i < amount; i++)
    {
        cin >> yn[i];
        cin >> score[i];
        if (yn[i] == "NIE")
        {
            score[i] = -1;
        }
    }

    for (int i = 0; i < 10; i++)
    {
        int maxPos = 0;
        for (int j = 0; j < amount; j++)
        {
            if (score[j] >= score[maxPos])
            {
                maxPos = j;
            }
        }
        top[i] = maxPos+1;
        score[maxPos] = -1;
    }

    for (int i = 0; i < amount; i++)
    {
        if (score[i] > 2)
        {
            score[i] = -1;
        }
    }

    for (int i = 10; i < 20; i++)
    {
        int maxPos = 0;
        for (int j = 0; j < amount; j++)
        {
            if (score[j] >= score[maxPos])
            {
                maxPos = j;
            }
        }
        top[i] = maxPos + 1;
        score[maxPos] = -1;
    }

    sort(top, top + 20);

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

    return 0;

}