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
// Project: sum
#include <bits/stdc++.h>
using namespace std;

int n;
#define SIZE 500005
int tab[SIZE];
int nums[SIZE];
set<int> avail_;
vector<int> avail;

bool check(int m) {
    int sval = avail[m];
    long long cval = 0;
    int i = lower_bound(nums, nums + n, sval) - nums;
    for (int j = 0; j <= i; j++) {
        cval += nums[i];
    }

    for (int j = i + 1; j < n; j++) {
        if (cval > nums[j]) {
            cval += nums[j];
        } else {
            return false;
        }
    }

    return true;
}

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

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> tab[i];
        nums[i] = tab[i];
        avail_.insert(nums[i]);
    }
    sort(nums, nums + n);

    for (int c : avail_) avail.push_back(c);
    avail_.clear();

    int l = 0, r = avail.size();
    avail.push_back(INT_MAX);

    while (l < r) {
        int m = (l + r) / 2;
        if (check(m)) {
            r = m;
        } else {
            l = m + 1;
        }
    }

    string s;
    for (int i = 0; i < n; i++) {
        if (avail[l] <= tab[i]) {
            s += 'T';
        } else {
            s += 'N';
        }
    }

    cout << s << endl;
}