#include<iostream>
#include<algorithm>
#include<list>
#include<map>
using namespace std;
int k, n;
string s;
char c;
map<char, list<string> > M;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
cin >> k >> n;
for(int i=0;i<k;i++) {
cin >> s; M[s[0]].push_back(s);
}
for(char c='a';c<='z';c++) if(!M[c].empty()) M[c].sort();
while(n--) {
cin >> c;
list<string>::iterator it = M[c].begin();
cout << *it << "\n";
M[c].push_back(*it);
M[c].erase(it);
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
114 ms |
10744 KB |
Output is correct |
8 |
Correct |
115 ms |
10912 KB |
Output is correct |
9 |
Correct |
116 ms |
10780 KB |
Output is correct |
10 |
Correct |
118 ms |
10836 KB |
Output is correct |