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
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<long long>v;
vector<long long>av;
void sv(long long a, long long b)
{
    long long l=0;
    long long x=a;
    while(x>av[l])
    {
        x+=av[l];
        l++;
    }
    if(x>b)
    {
        cout << "T";
    }
    else
    {
        cout << "N";
    }
}
int main()
{
    cin.tie(NULL);
    ios_base::sync_with_stdio(0);
    long long n,m=0,tmp,z=0;
    cin >> n;
    for(int i=0;i<n;i++)
    {
        cin >> tmp;
        v.push_back(tmp);
        av.push_back(tmp);
        m=max(tmp,m);
    }
    sort(av.begin(), av.end());
    for(int i=0;i<n;i++)
    {
        while(v[i]!=av[z])
        {
            z++;
        }
        av[z]=0;
        sv(v[i],m);
        av[z]=v[i];
        z=0;
    }
    return 0;
}