#include<bits/stdc++.h> using namespace std; int A[(int)5e5+5]; int B[(int)5e5+5]; int n; bool bla(long long q,int j){ int i=0; for(;i<n;i++){ if(i==j)continue; if(B[i]<q)q+=B[i]; else break; } if(i==n)return true; else return false; } int main(){ ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); cin>>n; bool z=0; for(int i=0;i<n;i++){ cin>>A[i];B[i]=A[i]; } sort(B,B+n); int k=n;int p=0; while(k-p>1){ int m=(k+p)/2; if(bla((long long)B[m],m))k=m; else p=m; } for(int i=0;i<n;i++){ if(A[i]>B[p])cout<<"T"; else cout<<"N"; } return 0; }
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 | #include<bits/stdc++.h> using namespace std; int A[(int)5e5+5]; int B[(int)5e5+5]; int n; bool bla(long long q,int j){ int i=0; for(;i<n;i++){ if(i==j)continue; if(B[i]<q)q+=B[i]; else break; } if(i==n)return true; else return false; } int main(){ ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); cin>>n; bool z=0; for(int i=0;i<n;i++){ cin>>A[i];B[i]=A[i]; } sort(B,B+n); int k=n;int p=0; while(k-p>1){ int m=(k+p)/2; if(bla((long long)B[m],m))k=m; else p=m; } for(int i=0;i<n;i++){ if(A[i]>B[p])cout<<"T"; else cout<<"N"; } return 0; } |