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
#include <bits/stdc++.h>

using namespace std;
int tab[500002],st[500002], Min,ileMin=1,Minimalna;
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> tab[i]; st[i] = tab[i];
    }
    sort(st, st + n+1);
    int i = 2;
    Min = st[1];
    while (st[i] == st[1])
    {
        ileMin++; i++;
    }
    long long prefix = ileMin * Min; bool z = 0;
    for (; i < n; i++)
    {
        prefix += st[i];
        //cout << prefix << " ";
        if (prefix <= st[i + 1])
        {
            Minimalna = st[i + 1]; z = 1;
        }
    }
    if (!z)
    {
        Minimalna = Min + 1;
    }
    for (int i = 1; i <= n; i++)
    {
        if (tab[i] >= Minimalna)
            cout << 'T'; 
        else cout << 'N';
    }
    return 0;
}