C语言程序设计-1065 单身狗

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
int main(){
	int N, n1, n2, M, m, a[100000]={0}, cnt = 0, flag = 0;
	cin >> N;
	map<int, int> ma;
	for(int i = 0; i < N; i++){
		cin >> n1 >> n2;
		ma[n1] = n2; ma[n2] = n1; 
	}
	cin >> M;
	vector<int> v(M);
	vector<int> ans;
	for(int i = 0; i < M; i++){
		cin >> v[i];
		a[v[i]] = 1;
	}
	sort(v.begin(), v.end());
	for(int i = 0; i < v.size(); i++){
		if( !a[ma[v[i]]] ){
			cnt++; 
            ans.push_back(v[i]);
		}
	}
	printf("%d\n", cnt);
	for(int i = 0; i < ans.size(); i++){
		printf("%s%05d", flag?" ":"", ans[i]);
		flag = 1;
	}
	return 0;	
}