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<vector>
#include<string>
#include<algorithm>
#include<set>
#include<map>
using namespace std;
int n, m;
set<string> s;
map<string, string> cp;
vector<string> v;
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		string t1, t2;
		cin >> t1 >> t2;
		cp[t1] = t2, cp[t2] = t1;
	}
	cin >> m;
	bool flag[10010];
	for (int i = 0; i < m; i++) {
		string t3;
		cin >> t3;
		s.insert(t3);
		v.push_back(t3);
	}
	int cnt = 0; 
	int num[10010], j = 0;
	for (int i = 0; i < m; i++) {
		if (s.find(cp[v[i]]) == s.end()) {
			cnt++;
			flag[i] = 1; 
			num[j++] = stoi(v[i]);
		}
	}
	sort(num, num + cnt);
	printf("%d\n", cnt);
	for (int i = 0; i < cnt; i++) {
		if (i == 0) printf("%05d", num[i]);
		else printf(" %05d", num[i]);
	}
	return 0;
}