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

using namespace std;

int tab[500010];
int tabs[500010];
long long pre[500010];

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&tab[i]);
        tabs[i]=tab[i];
    }

    sort(tabs+1,tabs+n+1);

    for(int i=1;i<=n;i++){
        pre[i]=pre[i-1]+tabs[i];
    }

    int lic=n-1;
    while((long long)tabs[lic]+pre[lic-1]>tabs[lic+1]){
        lic--;
    }

    int rmin=tabs[lic];
    for(int i=1;i<=n;i++){
        if(tab[i]>rmin){
            printf("T");
        } else {
            printf("N");
        }
    }
    printf("\n");
    return 0;
}