#include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<pair<int, int>> placeAndCountVec; string word; int count; for (int i = 1; i <= n; i++) { cin >> word >> count; if (word == "TAK") { placeAndCountVec.push_back({i, count}); } } // first 10 for (int i = 0; i < 10; i++) { cout << placeAndCountVec[i].first << " "; } // next x of under 2 count int winners = 10; for (int i = 10; i < placeAndCountVec.size() && winners < 20; i++) { if (placeAndCountVec[i].second < 2) { cout << placeAndCountVec[i].first << " "; winners++; } } }
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 | #include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<pair<int, int>> placeAndCountVec; string word; int count; for (int i = 1; i <= n; i++) { cin >> word >> count; if (word == "TAK") { placeAndCountVec.push_back({i, count}); } } // first 10 for (int i = 0; i < 10; i++) { cout << placeAndCountVec[i].first << " "; } // next x of under 2 count int winners = 10; for (int i = 10; i < placeAndCountVec.size() && winners < 20; i++) { if (placeAndCountVec[i].second < 2) { cout << placeAndCountVec[i].first << " "; winners++; } } } |