#include <bits/stdc++.h> using namespace std; char letters[7] = {'x', 'x', 'x', 'a', 'c', 'g', 'w'}; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int fish[n], sortedFish[n]; for (int i = 0; i < n; ++i){ int inFish; cin >> inFish; fish[i] = inFish; sortedFish[i] = inFish; } sort(sortedFish, sortedFish + n); int lowest, king, biggerIndex = -1; long long ps[n]; ps[0] = sortedFish[0]; for (int i = 1; i < n; ++i){ ps[i] = sortedFish[i] + ps[i-1]; if (biggerIndex == -1 and sortedFish[i] != sortedFish[0]){ biggerIndex = i; } } king = sortedFish[biggerIndex]; for (int i = biggerIndex + 1; i < n; ++i){ if (ps[i - 1] <= sortedFish[i]){ king = sortedFish[i]; } } if (sortedFish[0] != sortedFish[n-1]){ for (int i = 0; i < n; ++i){ if (fish[i] >= king){ cout << 'T'; } else { cout << 'N'; } } } else { for (int i = 0; i < n; ++i) { cout << '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 56 57 58 | #include <bits/stdc++.h> using namespace std; char letters[7] = {'x', 'x', 'x', 'a', 'c', 'g', 'w'}; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int fish[n], sortedFish[n]; for (int i = 0; i < n; ++i){ int inFish; cin >> inFish; fish[i] = inFish; sortedFish[i] = inFish; } sort(sortedFish, sortedFish + n); int lowest, king, biggerIndex = -1; long long ps[n]; ps[0] = sortedFish[0]; for (int i = 1; i < n; ++i){ ps[i] = sortedFish[i] + ps[i-1]; if (biggerIndex == -1 and sortedFish[i] != sortedFish[0]){ biggerIndex = i; } } king = sortedFish[biggerIndex]; for (int i = biggerIndex + 1; i < n; ++i){ if (ps[i - 1] <= sortedFish[i]){ king = sortedFish[i]; } } if (sortedFish[0] != sortedFish[n-1]){ for (int i = 0; i < n; ++i){ if (fish[i] >= king){ cout << 'T'; } else { cout << 'N'; } } } else { for (int i = 0; i < n; ++i) { cout << 'N'; } } return 0; } |