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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve(){
    int n;
    cin >> n;

    vector<int> sumy(n);
    vector<int> sort_sumy(n);
    vector<long long> sum_sumy(n);

    for(int i = 0; i < n; i++) {
        cin >> sumy[i];
    }
    
    sort_sumy = sumy;
    sort(sort_sumy.begin(), sort_sumy.end());

    sum_sumy[0] = sort_sumy[0];
    
    for(int i = 1; i < n; i++) {
        sum_sumy[i] = sum_sumy[i-1] + sort_sumy[i];
    }

    int split_value = 1e9 + 1;

    if(sort_sumy[n-1] != sort_sumy[0]) {
        split_value = sort_sumy[n-1];
        for(int i = n - 2; i > 0; i--) {
            if(sort_sumy[i] == sort_sumy[0]) break;
            
            if(sum_sumy[i] <= sort_sumy[i+1]) break;

            split_value = sort_sumy[i];
        }
    } 

    for(int i = 0; i < n; i++) {
        if(sumy[i] >= split_value) cout << "T";
        else cout << "N";
    }
    cout << "\n";
}

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

    solve();

    return 0;
}