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
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;

int n;
vector<ll> a, _a;

bool check(int x){
  ll curr = a[x];

  for(int i = 1; i <= n; i++){
    if(i == x) continue;

    if(a[i] < curr)
      curr += a[i];
    else
      return false;
  }

  return true;
}

int main(){
  fastio;
  cin >> n;
  a.resize(n+1);
  _a.resize(n+1);

  for(int i = 1; i <= n; i++){
    cin >> a[i];
    _a[i] = a[i];
  }

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

  int l = 1, r = n, w = 0;
  while(l <= r){
    int m = (l+r)/2;
    if(check(m))
      r = m-1, w = m;
    else
      l = m+1;
  }

  for(int i = 1; i <= n; i++){
    if(_a[i] >= a[w] && w != 0)
      cout << "T";
    else
      cout << "N";
  }
}