#include <bits/stdc++.h>
using namespace std;
vector<string> dict[40];
int idx[40];
int n, m, k;
int main()
{
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cin >> n >> m;
string s;
for(int i = 1; i <= n; i++)
{
cin >> s;
dict[s[0] - 'a'].push_back(s);
}
for(int i = 0; i < n; i++) sort(dict[i].begin(), dict[i].end());
for(int i = 1;i <= m; i++)
{
cin >> s;
k = s[0] - 'a';
cout << dict[k][idx[k]] << endl;
idx[k] = (idx[k] + 1) % (int)dict[k].size();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
3 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
4 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
5 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
6 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
7 |
Runtime error |
45 ms |
9556 KB |
Execution killed with signal 11 |
8 |
Runtime error |
46 ms |
9564 KB |
Execution killed with signal 11 |
9 |
Runtime error |
47 ms |
9552 KB |
Execution killed with signal 11 |
10 |
Runtime error |
45 ms |
9668 KB |
Execution killed with signal 11 |