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
#include <bits/stdc++.h>
typedef long long ll;

struct P { int i, val; bool ans; };

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);

	int n;
	std::cin >> n;

	std::vector<P> v(n);
	for (int i = 0; i < n; i++) {
		v[i].i = i;
		std::cin >> v[i].val;
	}
	std::sort(v.begin(), v.end(), [](P a, P b) { return a.val < b.val; });

	int first_correct = INT_MAX;
	ll sum = v[0].val;
	v[0].ans = false;
	for (int i = 1; i < n; i++) {
		if (v[i-1].ans) v[i].ans = true;	
		else {
			if (v[i-1].val == v[i].val) v[i].ans = false;
			else {
				v[i].ans = true;
				first_correct = i;
			}
		}
		if (v[i].ans && sum <= v[i].val) first_correct = i;
		sum += v[i].val;
	}

	for (int i = 0; i < n; i++) v[i].ans = (i >= first_correct);
	std::sort(v.begin(), v.end(), [](P a, P b) { return a.i < b.i; });
	for (auto [_, __, ans] : v) std::cout << (ans ? 'T' : 'N');
	std::cout << '\n';

	return 0;
}