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
#include <iostream>
#include <vector>
#include <algorithm>
#define st first
#define nd second
typedef long long ll;
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    vector<pair<ll, int>> s(n);
    vector<bool> ok(n);
    ll sum = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> s[i].st;
        sum += s[i].st;
        s[i].nd = i;
    }
    sort (s.begin(), s.end());
    ok[s[n-1].nd] = true;
    sum -= s[n-1].st;
    for (int i = n-2; i >= 0; i--)
    {
        if (sum > s[i+1].st) ok[s[i].nd] = true;
        else break;
        sum -= s[i].st;
    }
    for (int i = 1; i < n; i++)
    {
        if (s[i].st == s[i-1].st) ok[s[i].nd] = false;
        else break;
    }
    for (int i = 0; i < n; i++)
    {
        if (ok[i]) cout << 'T';
        else cout << 'N';
    }
}