#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
typedef long double ld;
typedef long long ll;
typedef short int si;
set <pair <int, string> > se[27];
int main()
{
// freopen("input4.txt", "r", stdin); freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
se[s[0] - 'a'].insert({0, s});
}
for (; m > 0; m--)
{
char c;
cin >> c;
int t = c - 'a';
pair <int, string> pt = *se[t].begin();
se[t].erase(se[t].begin());
cout << pt.S << '\n';
se[t].insert({pt.F + 1, pt.S});
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
153 ms |
12384 KB |
Output is correct |
8 |
Correct |
154 ms |
12408 KB |
Output is correct |
9 |
Correct |
156 ms |
12408 KB |
Output is correct |
10 |
Correct |
156 ms |
12376 KB |
Output is correct |