// PA 2024 1C - Finalisci #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, k; string s; vector<int> fin1; vector<int> fin2; cin >> n; for (int i = 0; i < n; ++i) { cin >> s; cin >> k; if (s == "NIE" || fin2.size() >= 10) { continue; } if (fin1.size() < 10) { fin1.push_back(i + 1); continue; } if (k < 2) { fin2.push_back(i + 1); } } for (int i = 0; i < 10; ++i) { cout << fin1[i] << " "; } for (int i = 0; i < 10; ++i) { cout << fin2[i] << " "; } 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 | // PA 2024 1C - Finalisci #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, k; string s; vector<int> fin1; vector<int> fin2; cin >> n; for (int i = 0; i < n; ++i) { cin >> s; cin >> k; if (s == "NIE" || fin2.size() >= 10) { continue; } if (fin1.size() < 10) { fin1.push_back(i + 1); continue; } if (k < 2) { fin2.push_back(i + 1); } } for (int i = 0; i < 10; ++i) { cout << fin1[i] << " "; } for (int i = 0; i < 10; ++i) { cout << fin2[i] << " "; } return 0; } |