20分玄关求调

#include<bits/stdc++.h>
using namespace std;
int n;
map<string,string> dic;
queue<char> stay;
string answer;


int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		string a,b;
		cin>>a>>b;
		dic[a]=b;
	}
	string tmp;
	cin>>tmp;
	for(int i=0;i<tmp.size();i++){
		if(tmp[i]>='a'&&tmp[i]<='z')	stay.push(tmp[i]);
		else{
			if(stay.empty())	answer+=tmp[i];
			else{
				string finding="";
				while(!stay.empty()){
					char c=stay.front();
					finding+=c;
					stay.pop();
				}
				if(dic[finding].size())	answer+=dic[finding];
				else	answer+="UNK";
				answer+=tmp[i];
			}
		}
	}
	string other="";
	while(!stay.empty()) {
		char c=stay.front();
		other+=c;
		stay.pop();
	}
	if(dic[other].size())	answer+=dic[other];
	else	answer+="UNK";
	
	cout<<answer<<endl;
	return 0;
}