#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
int k, n, ind[26];
vector <string> s[26];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> k >> n;
for (int i = 0; i < k; i++){
string t;
cin >> t;
s[t[0] - 'a'].push_back(t);
}
for (int i = 0; i < 26; i++)
sort(all(s[i]));
for (int i = 0; i < n; i++){
char x;
cin >> x;
cout << s[x - 'a'][ind[x-'a']%s[x-'a'].size()] << "\n";
ind[x-'a']++;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
67 ms |
6316 KB |
Output is correct |
8 |
Correct |
72 ms |
6312 KB |
Output is correct |
9 |
Correct |
69 ms |
6268 KB |
Output is correct |
10 |
Correct |
71 ms |
6264 KB |
Output is correct |