#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<pair<int, int>> v(n); long long sum = 0; for (int i = 0; i < n; ++i) { cin >> v[v[i].second = i].first; sum += v[i].first; } string s = ""; for (int i = 0; i < n; ++i) s += 'N'; sort(v.begin(), v.end()); int i; if (v[n - 1].first == v[0].first) { cout << s << '\n'; return 0; } s[v[n - 1].second] = 'T'; for (i = n - 1; i > 0; --i) { sum -= v[i].first; if (v[i - 1].first == v[0].first || sum <= v[i].first) break; s[v[i - 1].second] = 'T'; } cout << s << '\n'; }
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<pair<int, int>> v(n); long long sum = 0; for (int i = 0; i < n; ++i) { cin >> v[v[i].second = i].first; sum += v[i].first; } string s = ""; for (int i = 0; i < n; ++i) s += 'N'; sort(v.begin(), v.end()); int i; if (v[n - 1].first == v[0].first) { cout << s << '\n'; return 0; } s[v[n - 1].second] = 'T'; for (i = n - 1; i > 0; --i) { sum -= v[i].first; if (v[i - 1].first == v[0].first || sum <= v[i].first) break; s[v[i - 1].second] = 'T'; } cout << s << '\n'; } |