"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
分类:1、单身---输出;2、有配偶但是配偶未到---输出;3、有配偶且配偶已到--不输出
因此用一个map记录对应配偶,一个set记录已到id,若他们配偶到了则清除。
#include <iostream>
#include <map>
#include <set>
using namespace std;
int main(){
int n, k;
cin>>n;
map<int,int>m;
for(int i = 0; i < n; i++){
int a,b;
scanf("%d %d",&a,&b);
m[a] = b;
m[b] = a;
}
cin>>k;
set<int>ans;
for(int i = 0; i < k; i++){
int temp;
scanf("%d",&temp);
if(m.find(temp) != m.end() && ans.find(m[temp]) != ans.end())
ans.erase(m[temp]);
else
ans.insert(temp);
}
printf("%d\n", ans.size());
for(auto it = ans.begin(); it != ans.end(); it++){
if(it != ans.begin())
printf(" ");
printf("%05d",*it);
}
}