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

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);

	int n;
	cin >> n;
	vector<int> s(n);
	vector<int> m(n);

	for (int i = 0; i < n; ++i) {
		cin >> s[i];
		m[i] = s[i];
	}

	sort(m.begin(), m.end());

	long long a = 0;
	int w = 0;
	for (int i = 0; i < n - 1; ++i) {
		a += m[i];
		if (a <= m[i + 1]) {
			w = m[i];
		}
	}

	string o;
	o.reserve(n + 1);
	for (int i = 0; i < n; ++i) {
		o.push_back(s[i] <= w ? 'N' : 'T');
	}
	cout << o << endl;

	return 0;
}