View Code of Problem 7

#include<iostream>
using namespace std;

int findNumber(int a[], int n, int s){
	int i,k;
	k = 0;
	for(i=0;i<n;i++){
		if(s == a[i]){
			k = i;
			break;
		}
	}
	if(i == n)
		return -1;
	else
		return k;
}

int main(){
	int T,n,i,m,k;
	char ch;
	int eql[2000];
	int s[2000];
	cin>>T;
	while(T--){
		cin>>n;
		n = n * 2;
		for(i=0;i<n;i=i+2){
			cin>>eql[i]>>ch>>eql[i+1];
		}
		cin>>m;
		for(i=0;i<m;i++){
			cin>>s[i];
		}
		for(i=0;i<m;i++){
			k = findNumber(eql, n, s[i]);
			if(k == -1)
				cout<<"UNKNOW"<<endl;
			else if(k % 2 == 0)
				cout<<eql[k+1]<<endl;
			else
				cout<<eql[k-1]<<endl;
		}
	}
}