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

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);

    long long su=0;
    int n;
    cin>>n;
    vector<int> a;
    for (int i=0; i<n; ++i)
    {
        int aa;
        cin>>aa;
        a.push_back(aa);
        su+=aa;
    }

    vector<int> s=a;
    sort(s.begin(), s.end());
    reverse(s.begin(), s.end());
    int mi=s[n-1];

    int kr;
    if (s[0]==mi) kr=s[0]+1;
    else
    {
        kr=s[0];
        for (int i=0; i<n; su-=s[i], ++i)
        {
            if (kr<=s[i])
                continue;
            if (s[i]==mi)
                break;
            if (su<=kr)
                break;
            kr=s[i];
        }
    }

    for (int i=0; i<n; ++i)
        cout<<(a[i]<kr ? 'N' : 'T');
    cout<<endl;
    return 0;
}