#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
deque<pair<int, int>> v;
for (int i = 0; i < n; i++)
{
string s;
int x;
cin >> s >> x;
if (s == "TAK")
v.push_back(make_pair(i, x));
}
vector<int> res;
for (int i = 0; i < 10; i++)
{
res.push_back(v[0].first);
v.pop_front();
}
while (res.size() < 20)
{
if (v[0].second < 2)
res.push_back(v[0].first);
v.pop_front();
}
for (auto &e : res)
cout << e+1 << " ";
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 | #include <bits/stdc++.h> using namespace std; typedef long long LL; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; deque<pair<int, int>> v; for (int i = 0; i < n; i++) { string s; int x; cin >> s >> x; if (s == "TAK") v.push_back(make_pair(i, x)); } vector<int> res; for (int i = 0; i < 10; i++) { res.push_back(v[0].first); v.pop_front(); } while (res.size() < 20) { if (v[0].second < 2) res.push_back(v[0].first); v.pop_front(); } for (auto &e : res) cout << e+1 << " "; cout << "\n"; } |
English