#include <iostream> #include <map> #include <vector> #include <algorithm> using namespace std; int main() { int n, x; string s; vector<int> qualified; cin >> n; for (int i = 1; i <= n; i++) { cin >> s >> x; if (s == "NIE") continue; if (qualified.size() < 10) { qualified.push_back(i); } else { if (x < 2) { qualified.push_back(i); } } } for (int i = 0; i < 20; i++) { cout << qualified[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 | #include <iostream> #include <map> #include <vector> #include <algorithm> using namespace std; int main() { int n, x; string s; vector<int> qualified; cin >> n; for (int i = 1; i <= n; i++) { cin >> s >> x; if (s == "NIE") continue; if (qualified.size() < 10) { qualified.push_back(i); } else { if (x < 2) { qualified.push_back(i); } } } for (int i = 0; i < 20; i++) { cout << qualified[i] << " "; } return 0; } |