1121 Damn Single (25分)

1121 Damn Single (25分)

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 1e6+10;
int Hash[maxn] = { 0 }, exist[maxn] = { 0 };
int main() {
	fill(Hash, Hash + maxn, -1);//不要初始化为0，否则第二个点过不去，因为客人id可能为00000。
	int n, m, a, b;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d%d", &a,&b);
		Hash[a] = b;
		Hash[b] = a;
	}
	scanf("%d", &m);
	for (int i = 0; i < m; i++) {
		scanf("%d", &a);
		exist[a] = 1;
	}
	vector<int> ans;
	for (int i = 0; i < maxn; i++) {
		if (exist[i]) {
			if (Hash[i] == -1 || exist[Hash[i]] == 0) {
				ans.push_back(i);
			}
		}
	}
	sort(ans.begin(), ans.end());
	printf("%d\n", ans.size());
	for (int i = 0; i < ans.size(); i++) {
		printf("%05d", ans[i]);//记得格式化
		if (i != ans.size() - 1) {
			printf(" ");
		}
	}
	return 0;
}