View Code of Problem 7

#include <iostream>
#include <algorithm>
#include <string.h>
#include <map>
using namespace std;
typedef struct{int l,r;}f;
map<int,int> M;
int main()
{
    std::ios::sync_with_stdio(false);
    int T,n,m;int key,value;int k;cin>>T;
     map<int,int>::iterator it;
    while(T--){
        cin>>n;
        for(int i=0;i<n;i++){
            cin>>key;cin.get();cin>>value;
            M.insert(map<int,int> :: value_type(key,value));
            M.insert(map<int,int> :: value_type(value,key));
        }
        cin>>m;
        for(int i=0;i<m;i++){
            cin>>k;
           it=M.find(k);
            if(it==M.end()){
                cout<<"UNKNOW"<<endl;
            }
            else cout<<M[k]<<endl;
        }
        M.clear();
        cout<<endl;
    }
    return 0;
}