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
// #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main()
{
    FAST int n;
    int64_t sum, tmp;
    cin >> n;
    map<int64_t, int64_t> m;
    vector<int64_t> a(n);

    for (int i = 0; i < n; i++)
    {
        cin >> tmp;
        m[tmp]++;
        a[i] = tmp;
    }
    auto it = m.begin();

    if (m.size() == 1)
    {
        for (int i = 0; i < (*it).second; i++)
        {
            cout << "N";
        }
        cout << endl;
        return 0;
    }

    int64_t total = 0;
    int64_t lastK = (*it).first;
    int64_t lastV = (*it).second;
    int64_t tooSmall = lastK;
    it++;
    for (; it != m.end(); it++)
    {
        total += lastK * lastV;
        if (total <= (*it).first)
        {
            tooSmall = lastK;
        }
        lastK = (*it).first;
        lastV = (*it).second;
    }
    for (int i = 0; i < n; i++)
    {
        if (a[i] > tooSmall)
        {
            cout << "T";
        }
        else
        {
            cout << "N";
        }
    }
    cout << endl;
    return 0;
}