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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long long, long long> pll;

int n;
ll a[500009];
map<ll, int> M;
vector<ll> v;
vector<pair<ll, ll>> k;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    cin >> n;

    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        M[a[i]] = 0;
        v.pb(a[i]);
    }

    if(n == 1)
    {
        cout << "T\n";
        return 0;
    }

    sort(v.begin(), v.end());

    if(v[0] == v[v.size() - 1])
    {
        for(int i = 1; i <= n; i++)
        {
            cout << "N";
        }
        cout << "\n";
        return 0;
    }

    for(int i = 0; i < v.size(); i++)
    {
        if(k.empty() || k[k.size() - 1].fi != v[i])
        {
            k.pb({v[i], 1});
        }
        else
        {
            k[k.size() - 1].se++;
        }
    }

    ll sum_of_smaller = 0;
    for(int i = 0; i < k.size() - 1; i++)
    {
        sum_of_smaller += k[i].fi * k[i].se;
    }

    int last_ok = k[k.size() - 1].fi;
    M[last_ok] = 1;
    for(int i = k.size() - 2; i >= 1; i--)
    {
        if(sum_of_smaller > last_ok)
        {
            M[k[i].fi] = 1;
            last_ok = k[i].fi;
        }
        else break;

        sum_of_smaller -= k[i].fi * k[i].se;
    }

    for(int i = 1; i <= n; i++)
    {
        if(M[a[i]] == 1)
            cout << "T";
        else
            cout << "N";
    }

    cout << "\n";
}