#include <bits/stdc++.h> #include <iostream> using namespace std; int n; long long a[500002], a_sorted[500002]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a_sorted[i] = a[i]; } sort(a_sorted + 1, a_sorted + n + 1); long long last_bad = 0; long long prefix_sum = 0; for (int i = 1; i <= n; i++) { prefix_sum += a_sorted[i]; if (prefix_sum <= a_sorted[i+1]) { last_bad = a_sorted[i]; } } for (int i = 1; i <= n; i++) { if (a[i] <= last_bad) { cout << 'N'; } else { cout << 'T'; } } cout << endl; 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 | #include <bits/stdc++.h> #include <iostream> using namespace std; int n; long long a[500002], a_sorted[500002]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a_sorted[i] = a[i]; } sort(a_sorted + 1, a_sorted + n + 1); long long last_bad = 0; long long prefix_sum = 0; for (int i = 1; i <= n; i++) { prefix_sum += a_sorted[i]; if (prefix_sum <= a_sorted[i+1]) { last_bad = a_sorted[i]; } } for (int i = 1; i <= n; i++) { if (a[i] <= last_bad) { cout << 'N'; } else { cout << 'T'; } } cout << endl; return 0; } |