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

using namespace std;

int main()
{
    int n;
    vector<pair<int,int>> per;
    vector<bool> result;

    cin >> n;

    result.resize(n);
    for (int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        per.push_back(make_pair(a, i));
        result[i] = true;
    }

    sort(per.begin(),per.end());
    
    int f_n = 1;

    for (int i = 1; i < n; i++) {
        if(per[0].first == per[i].first) f_n++;
    }

    if(f_n == n) {
        for (int i = 0; i < n; i++)
        {
            cout << "N";
        }
        cout << '\n';

        return 0;
    }

    long long sum = per[0].first * f_n;
    int p_seq = f_n;

    for (int i = f_n; i < n-1; i++)
    {
        if(sum + (long long) per[i].first <= (long long) per[i+1].first)
        {
            p_seq = i + 1;
        }

        sum += per[i].first;
    }

    for (int i = 0; i < p_seq; i++)
    {
        result[per[i].second] = false;
    }
    

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

    cout << '\n';
}