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

using namespace std;

constexpr int MAXN=5e5+7;
int tab[MAXN], ryby[MAXN];
long long suma[MAXN];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, krol;

    cin >> n;

    for (int i=0; i < n; i++) {
        cin >> ryby[i];

        tab[i] = ryby[i];
    }

    sort(tab, tab+n);

    krol = tab[0] + 1;
    suma[0] = tab[0];

    for (int i=1; i < n; i++) {
        if (tab[i] >= suma[i-1] & tab[i-1] != tab[i])
            krol = tab[i];

        suma[i] = suma[i-1] + tab[i];
    }

    for (int i=0; i < n; i++) {
        if (ryby[i] >= krol)
            cout << "T";

        else
            cout << "N";
    }

    return 0;
}