#include <iostream> #include <algorithm> using namespace std; int n, a[500005], maks; long long b[500005]; char s[500005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b+n); for (int i = 1; i < n; i++) b[i] += b[i - 1]; for (int i = n-1; i > 0; i--) { if (b[i] >= 2 * b[i-1]) { maks = b[i-1]; if (i > 1) maks -= b[i-2]; break; } } for (int i = 0; i < n; i++) { if (a[i] <= maks) s[i] = 'N'; else s[i] = 'T'; } puts(s); }
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 | #include <iostream> #include <algorithm> using namespace std; int n, a[500005], maks; long long b[500005]; char s[500005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b+n); for (int i = 1; i < n; i++) b[i] += b[i - 1]; for (int i = n-1; i > 0; i--) { if (b[i] >= 2 * b[i-1]) { maks = b[i-1]; if (i > 1) maks -= b[i-2]; break; } } for (int i = 0; i < n; i++) { if (a[i] <= maks) s[i] = 'N'; else s[i] = 'T'; } puts(s); } |