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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <iostream>
#include<vector>
#include <algorithm>
using namespace std;
int main(){
    long long a,sumka;
    sumka=0;
    cin>>a;
    vector <int>rypki;
    vector<int>pla;
    for(int i=0;i<a;i++){
        int b;
        cin>>b;
        rypki.push_back(b);
        pla.push_back(b);
        sumka=sumka+b;

    }
    long long l,p,mid,i,sum1;
    l=0;
    p=a-1; //1 2 2 7 8 8
    sort(pla.begin(),pla.end());
    while(l<p){

        i=0;
        int mid = (l+p)/2;
       //cout<<l<<" "<<p<<" "<<mid<<endl;
        sum1=pla[mid];
        bool xd=false;
        while(sum1>pla[i]&& i<a){
           if(pla[i]==pla[mid] && xd==false){
            xd=true;
           }else{
           sum1=sum1+pla[i];

           }
           i++;
        }
        if(sum1!=sumka){
            l=mid+1;
        }else{
            p=mid;
        }

    }
    if(l==a-1){
        int i=0;
        bool xd=false;
        sum1=pla[l];
        while(sum1>pla[i]&& i<a){
           if(pla[i]==pla[l] && xd==false){
            xd=true;
           }else{
           sum1=sum1+pla[i];

           }
           i++;
        }
        if(sum1!=sumka){
            pla[l]=1000000007;
                    }
    }
    int x;
    x=pla[l];
    for(int i=0;i<a;i++){
        if(x<=rypki[i]){
            cout<<"T";
        }else{
            cout<<"N";
        }
    }

    return 0;
}