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
//
//  main.cpp
//  sum
//
//  Created by Wojciech Siwko on 09/12/2021.
//

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, temp; cin >> n;
    vector<pair<int, int>> w(n);
    vector<long long> sums(n);
    vector<bool> res(n, false);
    for (int i = 0; i < n; i++) {
        cin >> temp;
        w[i] = {temp, i};
    }
    sort(w.begin(), w.end());
    sums[0] = 0;
    for (int i = 1; i < n; i++) {
        sums[i] = sums[i-1] + w[i-1].first;
    }
    if (w.back().first > w[0].first) res[w.back().second] = true;
    for (int i = n-2; i >= 1; i--) {
        if (sums[i] + w[i].first > w[i+1].first && w[i].first > w[0].first) {
            res[w[i].second] = true;
        } else break;
    }
    for (int i = 0; i < res.size(); i++) {
        if (res[i]) cout << "T";
        else cout << "N";
    }
    cout << endl;
    return 0;
}