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
72
73
74
75
76
77
78
79
80
81
#include <iostream>
#include <algorithm>

using namespace std;

#define ll long long int

int main()
{

    ll n;
    cin >> n;

    bool* cantWin = new bool[n];

    ll prev = -1;
    ll sumAlready = 0;
    bool pastFirstGroup = false;

    ll* originalData = new ll[n]();
    ll* data = new ll[n]();

    for (ll i = 0; i < n; i++)
    {
        cin >> data[i];
        originalData[i] = data[i];
    }

    if (n == 1)
    {
        cout << "T";
        return 0;
    }

    sort(data, data + n);

    ll highestBreakPoll = -1;
    for (ll i = 0; i < n; i++)
    {
        if (prev != -1 && prev != data[i])
        {
            if (!pastFirstGroup)
            {
                highestBreakPoll = data[i];
                pastFirstGroup = true;
            }
            

            if (data[i] >= sumAlready)
            {
                highestBreakPoll = data[i];
            }
        }

        if (!pastFirstGroup)
        {
            cantWin[i] = true;
        }

        sumAlready += data[i];
        prev = data[i];
    }

    if (highestBreakPoll == -1 && !pastFirstGroup)
    {
        highestBreakPoll = originalData[n - 1] + 1;
    }

    for (ll i = 0; i < n; i++)
    {
        if (originalData[i] < highestBreakPoll)
        {
            cout << "N";
        }
        else
        {
            cout << "T";
        }
    }
    cout << '\n';
}