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
#include <bits/stdc++.h>
using namespace std;

bool odp[500007];

bool cmp(pair <int, int> a, pair <int, int> b)
{
    return a.first > b.first;
}

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

    int a;
    cin >> a;

    pair <int, int> tab[a];

    for(int i = 0; i < a; i++)
    {
        cin >> tab[i].first;
        tab[i].second = i;
    }

    sort(tab, tab + a, cmp);

    int mini = tab[a - 1].first;

    long long pre[a + 1];
    pre[a] = 0;

    for(int i = a - 1; i >= 0; i--)
    {
        pre[i] = pre[i + 1];
        pre[i] += tab[i].first;
    }
    
    bool f = 0;

    for(int i = 0; i < a; i++)
    {
        if(f == 1)
        {
            odp[tab[i].second] = 1;
        }
        else
        {
            if(pre[i + 1] <= (long long)tab[i].first)
            {
                f = 1;
            }

            if(tab[i].first == mini)
            {
                f = 1;
                odp[tab[i].second] = 1;
            }
        }
    }

    for(int i = 0; i < a; i++)
    {
        if(odp[i] == 1)
        {
            cout << "N";
        }
        else
        {
            cout << "T";
        }
    }
    cout << endl;

    return 0;
}