#include <bits/stdc++.h> using namespace std; int n,r,l,mid,ans,a[500005]; pair<int,int>p[5000005]; bool is(int k) { long long pom,uj,sum = 0; bool ulu = true; uj = p[k].first; sum = uj; for(int i=1;i<=n;i++) { if(p[i].first < uj) sum += p[i].first; else if(i != k) { pom = p[i].first; if(pom >= sum) ulu = false; sum += pom; } } return ulu; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin>>n; for(int i=1;i<=n;i++) { cin>>p[i].first; p[i].second = i; } sort(p + 1,p + n + 1); l = 1; r = n; ans = n + 1; while(l <= r) { mid = (l + r) / 2; if(is(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } for(int i=1;i<=n;i++) { if(i >= ans) { a[p[i].second] = 1; } else a[p[i].second] = 0; } for(int i=1;i<=n;i++) { if(a[i] == 1) 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 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 | #include <bits/stdc++.h> using namespace std; int n,r,l,mid,ans,a[500005]; pair<int,int>p[5000005]; bool is(int k) { long long pom,uj,sum = 0; bool ulu = true; uj = p[k].first; sum = uj; for(int i=1;i<=n;i++) { if(p[i].first < uj) sum += p[i].first; else if(i != k) { pom = p[i].first; if(pom >= sum) ulu = false; sum += pom; } } return ulu; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin>>n; for(int i=1;i<=n;i++) { cin>>p[i].first; p[i].second = i; } sort(p + 1,p + n + 1); l = 1; r = n; ans = n + 1; while(l <= r) { mid = (l + r) / 2; if(is(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } for(int i=1;i<=n;i++) { if(i >= ans) { a[p[i].second] = 1; } else a[p[i].second] = 0; } for(int i=1;i<=n;i++) { if(a[i] == 1) cout<<'T'; else cout<<'N'; } return 0; } |