#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector <pair <int, int> > sumy(n); for (int i = 0; i < n; ++i) { int a; cin >> a; sumy[i] = {a, i}; } sort(sumy.begin(), sumy.end(), greater<pair <int, int> >()); vector <long long> suffsums(n); vector <int> nnext(n); suffsums[n - 1] = sumy[n - 1].first; for (int i = n - 2; i >= 0; --i) suffsums[i] = suffsums[i + 1] + sumy[i].first; string res(n, 'N'); for (int i = 0; i < n; ++i) { if (sumy[i].first == sumy[n - 1].first) { break; } if (i == 0 or sumy[i - 1].first < suffsums[i]) { res[sumy[i].second] = 'T'; } else { break; } } cout << res << "\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 | #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector <pair <int, int> > sumy(n); for (int i = 0; i < n; ++i) { int a; cin >> a; sumy[i] = {a, i}; } sort(sumy.begin(), sumy.end(), greater<pair <int, int> >()); vector <long long> suffsums(n); vector <int> nnext(n); suffsums[n - 1] = sumy[n - 1].first; for (int i = n - 2; i >= 0; --i) suffsums[i] = suffsums[i + 1] + sumy[i].first; string res(n, 'N'); for (int i = 0; i < n; ++i) { if (sumy[i].first == sumy[n - 1].first) { break; } if (i == 0 or sumy[i - 1].first < suffsums[i]) { res[sumy[i].second] = 'T'; } else { break; } } cout << res << "\n"; return 0; } |