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

注意：开始的3行代表夫妻对，后面7个给的是来的宾客，求自己来的宾客，并且从小到大排序，还有请注意，最后输出的的时候不要加换行，要不然23分，第二个输出样例过不了。

#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<cstdio>
using namespace std;
int main(){
	int n,m;
	vector<int> v(100000,-1),book(100000);
	cin>>n;
	for(int i = 0;i < n;i++){
		int a,b;
		cin >> a >> b;
		v[a] = b;
		v[b] = a;
	}
	cin >> m;
	vector<int> g(m+1);
	for(int i = 0;i < m;i++){
		cin >> g[i];
		if(v[g[i]] != -1)
		book[v[g[i]]] = 1;
	}
	set<int> s;
	for(int i= 0;i < m;i++){
		if(!book[g[i]]){
			s.insert(g[i]);
		}
	}
	cout << s.size() << endl;
	for(auto it = s.begin(); it != s.end();it++){
		if(it == s.begin()){
			printf("%05d",*it);
		}else{
			printf(" %05d",*it);
		}
	}
	//cout << endl;
	return 0;
}