#include <bits/stdc++.h>
#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)2e5 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;
set<pair<int, string>> st[N];
int main() {
int k, n; cin >> k >> n;
for (int i = 1; i <= k; ++i) {
string s; cin >> s;
int x = (s[0] - 'a');
st[x].insert({0, s});
}
for (int i = 1; i <= n; ++i) {
char ch; cin >> ch;
int x = (ch - 'a');
pair<int, string> cur = *st[x].begin();
st[x].erase(cur);
cout << cur.second << "\n";
cur.first++;
st[x].insert(cur);
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
9708 KB |
Output is correct |
2 |
Correct |
7 ms |
9708 KB |
Output is correct |
3 |
Correct |
9 ms |
9708 KB |
Output is correct |
4 |
Correct |
8 ms |
9708 KB |
Output is correct |
5 |
Correct |
9 ms |
9708 KB |
Output is correct |
6 |
Correct |
9 ms |
9708 KB |
Output is correct |
7 |
Correct |
471 ms |
20224 KB |
Output is correct |
8 |
Correct |
465 ms |
20204 KB |
Output is correct |
9 |
Correct |
469 ms |
20204 KB |
Output is correct |
10 |
Correct |
474 ms |
20204 KB |
Output is correct |