#include "bits/stdc++.h" using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n = *istream_iterator<int>(cin), sum = 0, a; map<int, pair<int, vector<int>>, greater<int>> M; for(int i = 0; i < n; i++) { M[a = *istream_iterator<int>(cin)].first++; M[a].second.push_back(i); sum += a; } vector<bool> res(n, false); long long before = 0, last = 0; for(const auto &[element, values] : M) { if(sum - before > last and sum > before + (element * values.first)) for(const auto &index : values.second) res[index] = true; else break; last = element; before += element * values.first; } for(const auto &element : res) cout << (element ? "T" : "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 | #include "bits/stdc++.h" using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n = *istream_iterator<int>(cin), sum = 0, a; map<int, pair<int, vector<int>>, greater<int>> M; for(int i = 0; i < n; i++) { M[a = *istream_iterator<int>(cin)].first++; M[a].second.push_back(i); sum += a; } vector<bool> res(n, false); long long before = 0, last = 0; for(const auto &[element, values] : M) { if(sum - before > last and sum > before + (element * values.first)) for(const auto &index : values.second) res[index] = true; else break; last = element; before += element * values.first; } for(const auto &element : res) cout << (element ? "T" : "N"); return 0; } |