// Jan Zakrzewski #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); vector<int> answer; queue<pair<int,int>> Queue; int n; cin >> n; for(int i = 1; i <= n; ++i) { string ok; int x; cin >> ok >> x; if(ok[0] == 'T') Queue.emplace(i, x); } for(int q = 10; q--;) { int i = Queue.front().first; Queue.pop(); answer.push_back(i); } for(int q = 10; q--;) { int i, x; while(true) { i = Queue.front().first; x = Queue.front().second; Queue.pop(); if(x < 2) break; } answer.push_back(i); } for(int i : answer) cout << i << " "; cout << "\n"; }
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 | // Jan Zakrzewski #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); vector<int> answer; queue<pair<int,int>> Queue; int n; cin >> n; for(int i = 1; i <= n; ++i) { string ok; int x; cin >> ok >> x; if(ok[0] == 'T') Queue.emplace(i, x); } for(int q = 10; q--;) { int i = Queue.front().first; Queue.pop(); answer.push_back(i); } for(int q = 10; q--;) { int i, x; while(true) { i = Queue.front().first; x = Queue.front().second; Queue.pop(); if(x < 2) break; } answer.push_back(i); } for(int i : answer) cout << i << " "; cout << "\n"; } |