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
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    long long n;
    cin >> n;
    vector<pair<long long, long long>>a(n);
    vector<bool>b(n,false);
    for(long long i = 0; i < n; i++)
    {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    for (long long i = 0; i < n; i++)
    {
        long long o = a[i].first;
        bool c = true;
        for (long long q = 0; q < n; q++)
        {
            if (q != i)
            {
                if (o > a[q].first)
                {
                    o += a[q].first;
                }
                else
                {
                    c = false;
                    break;
                }
            }
        }
        if (c == true)
        {
            b[a[i].second] = true;
        }
    }
    for (long long i = 0; i < n; i++)
    {
        if (b[i] == false)
        {
            cout << "N";
        }
        else
        {
            cout << "T";
        }
    }
    cout << endl;
}