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
/*
	Zadanie: Sumy
	Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 5e5 + 7;

pair<int, int> weight[MAXN];

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);
	
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> weight[i].fi;
		weight[i].se = i;
	}
	sort(weight + 1, weight + n + 1);
	weight[n + 1] = weight[n];

	ll sum = 0;
	ll tmp = 0;
	int ind = 0;
	for (int i = 1; i <= n+1; ++i) {
		tmp += weight[i].fi;
		if (weight[i].fi >= sum)
			ind = i;
		if (weight[i].fi != weight[1].fi) {
			sum += tmp;
			tmp = 0;
		}
	}

	string ans(n, 'N');
	for (int i = ind; i <= n; ++i)
		ans[weight[i].se - 1] = 'T';
	cout << ans << '\n';
	return 0;
}