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

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

    int n;
    cin >> n;
    
    vector<pair<int, int>> m(n);
    for(int i = 0; i < n; i++) {
        cin >> m[i].first;
        m[i].second = i;
    }
    sort(m.begin(), m.end());

    vector<int> idx(n);
    for(int i = 0; i < n; i++) {
        idx[m[i].second] = i;
    }

    unordered_map<int, int> occ;
    ll sum = 0;
    int br = 1e9;

    int prev = -1;
    int current = -1;

    bool first = true;
    int types = 0;

    for(int i = 0; i < n; i++) {
        if(current != m[i].first) {
            prev = current;
            current = m[i].first;
        }
        else if(br == i - 1 && first) {
            br = i;
        }


        if(first && prev != -1) {
            first = false;
            sum += occ[prev] * prev;
            br = i;
        }

        if(current >= sum && !first) {
            br = i;
        }

        if(!first) {
            sum += current;
        }

        if(current >= sum && prev != -1 && prev != current) {
            br = i;
        }

        types += (occ[current]++ == 0);
    }

    for(int i = 0; i < n; i++) {
        cout << "NT"[
            br <= idx[i] ||
            (i > 0 && idx[i] == n - 1 && types > 1)
        ];
    }
    cout << "\n";

    return 0;
}