#include <bits/stdc++.h> using namespace std; vector<int>sumy; vector<int>wynik; int n, a, mx, m; long long int c; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); cin >> n; for(int i = 0; i < n; ++i) { cin >> a; sumy.push_back(a); wynik.push_back(a); if(a > mx) {mx = a;} } sort(sumy.begin(), sumy.end()); m = sumy[0] + 1; for(int i = 0; i < sumy.size(); ++i) { if(m + c > sumy[i]) { c += sumy[i]; } else { m += sumy[i] + 1 - c - m; c += sumy[i] + 1 - c - m; c += sumy[i]; } } for(int i = 0; i < wynik.size(); ++i) { if(wynik[i] >= m) {cout << 'T';} else {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 | #include <bits/stdc++.h> using namespace std; vector<int>sumy; vector<int>wynik; int n, a, mx, m; long long int c; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); cin >> n; for(int i = 0; i < n; ++i) { cin >> a; sumy.push_back(a); wynik.push_back(a); if(a > mx) {mx = a;} } sort(sumy.begin(), sumy.end()); m = sumy[0] + 1; for(int i = 0; i < sumy.size(); ++i) { if(m + c > sumy[i]) { c += sumy[i]; } else { m += sumy[i] + 1 - c - m; c += sumy[i] + 1 - c - m; c += sumy[i]; } } for(int i = 0; i < wynik.size(); ++i) { if(wynik[i] >= m) {cout << 'T';} else {cout << 'N';} } return 0; } |