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

using namespace std;

#define UL unsigned long

int main() {
  int n;
  vector<UL> tab;
  vector<UL> sorted;
  vector<UL> cum;

  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    tab.push_back(x);
  }

  sorted = tab;
  sort(sorted.begin(), sorted.end());

  cum.push_back(sorted[0]);
  for (int i = 1; i < n; ++i) {
    cum.push_back(cum[i-1] + sorted[i]);
  }

  if (sorted[0] == sorted[n-1]) {
    for (int i = 0; i < n; ++i) {
      printf("N");
    }
    printf("\n");
    return 0;
  }

  UL min;
  for (int i = n-1; i > 0; --i) {
    if (cum[i-1] <= sorted[i] || sorted[i-1] == sorted[0]) {
      min = sorted[i];
      break;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (tab[i] >= min) {
      printf("T");
    } else {
      printf("N");
    }
  }
  printf("\n");
}