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<set>
#include<vector>
using namespace std;
int main(){
int n,m,arr[100000],a,b;
vector<int> v(100000,-1),exist(100000);
set<int> se;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d",&a,&b);
v[a]=b;
v[b]=a;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d",&arr[i]);
if(v[arr[i]]!=-1)//arr[i]有对象
exist[v[arr[i]]]=1;//假设对象来了 置为1
}
for(int i=0;i<m;i++){
if(exist[arr[i]]!=1)//如果对象没来 或者自己单身 则不为1(即此时自己一个人)插入se中。
se.insert(arr[i]);
}
printf("%d\n",(int)se.size());
for(auto it=se.begin();it!=se.end();it++){
if(it!=se.begin() ) printf(" ");
printf("%05d",*it);
}
}