#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n,m;
cin>>n>>m;
priority_queue<pair<int,string>,vector<pair<int,string>>,greater<pair<int,string>>> Q[26];
for(int i=0;i<n;i++){
string s;
cin>>s;
Q[s[0]-'a'].push({0,s});
}
for(int i=0;i<m;i++){
string s;
cin>>s;
int ind=s[0]-'a';
pair<int,string> q=Q[ind].top();
Q[ind].pop();
Q[ind].push({q.first+1,q.second});
cout<<q.second<<"\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
184 ms |
7196 KB |
Output is correct |
8 |
Correct |
183 ms |
7068 KB |
Output is correct |
9 |
Correct |
182 ms |
7220 KB |
Output is correct |
10 |
Correct |
187 ms |
7288 KB |
Output is correct |