1121 Damn Single（25 分）

"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 50,000), the total number of couples. Then N lines of the couples follow, each gives a couple of ID's which are 5-digit numbers (i.e. from 00000 to 99999). After the list of couples, there is a positive integer M (≤ 10,000) followed by M ID's of the party guests. The numbers are separated by spaces. It is guaranteed that nobody is having bigamous marriage (重婚) or dangling with more than one companion.

Output Specification:

First print in a line the total number of lonely guests. Then in the next line, print their ID's in increasing order. The numbers must be separated by exactly 1 space, and there must be no extra space at the end of the line.

Sample Input:

3
11111 22222
33333 44444
55555 66666
7
55555 44444 10000 88888 22222 11111 23333

Sample Output:

5
10000 23333 44444 55555 88888

#include<iostream>
#include<string>
#include<fstream>
#include<vector>
#include<set>
#include<map>
using namespace std;

map<string, string> mp;
map<string, int> mp2;
int main(){
	int n, m;
//	freopen("d://in.txt", "r", stdin);
	scanf("%d", &n);
	for(int i=0; i<n; i++){
		string str1, str2;
		cin >> str1 >> str2;
		mp[str1]=str2;
		mp[str2]=str1;
		mp2[str1]=1;
		mp2[str2]=1;
	}
	scanf("%d", &m);
	set<string> ans;
	vector<string> guest;
	for(int i=0; i<m; i++){
		string x;
		cin >> x;
		if(mp2[x]==0) ans.insert(x); 
		else guest.push_back(x); 
	}
	for(int i=0; i<guest.size(); i++){
		mp2[mp[guest[i]]]++;
	}
	for(int i=0; i<guest.size(); i++){
		if(mp2[guest[i]]==1) ans.insert(guest[i]); 
	}
	printf("%d\n", ans.size());
	for(set<string>::iterator it=ans.begin(); it!=ans.end(); it++){
		if(it!=ans.begin()) printf(" ");
		cout << *it;
	}
	return 0;
}