#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3xaMC2q ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
//e
signed main(){
_3xaMC2q;
int n,q;
cin>>n>>q;
vec(set<pair<int,string>>) rbts(26);
rep(i,n){
string s;
cin>>s;
rbts[s[0]-'a'].insert(pair<int,string>(0,s));
}
rep(_,q){
char ch;
cin>>ch;
int need=ch-'a';
assert(sz(rbts[need]));
auto it=rbts[need].begin();
pair<int,string> now=*it;
rbts[need].erase(it);
now.fi+=1;
cout<<now.se<<"\n";
rbts[need].insert(now);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
320 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
94 ms |
12320 KB |
Output is correct |
8 |
Correct |
94 ms |
12352 KB |
Output is correct |
9 |
Correct |
95 ms |
12312 KB |
Output is correct |
10 |
Correct |
93 ms |
12368 KB |
Output is correct |