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

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i=0; i<n; i++) {
        cin >> a[i];
    }
    vector<int> v(a);
    sort(v.begin(), v.end());
    int size {v[0]};
    long long total {size}; 
    int idx {};
    for (idx=1; idx<n && v[idx] == size; idx++) {
        total += size;
    }
    while (idx<n) {
        int tmp = v[idx];
        while (idx<n && v[idx] == tmp) {
            total += tmp;
            idx++;
        }
        if (idx<n) {
            if (total <= v[idx]) {
                size = tmp;
            }
        }
    }
    for (int i=0; i<n; i++) {
        cout << ((a[i] > size) ? "T" : "N");
    }
    cout << endl;
    return 0;
}