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

乙级觉得难，现在觉得简单。用map记录每队情侣，相互都要记录。然后将要判断的人输入进query数组，将这个人guest数组中++。然后遍历query数组，如果这个人对应的情侣在guest数组中为0，将其放入single数组中输出，single要排序一下。
坑点，只要是最后要输出id的，就要考虑前面是否要补0！

#include<iostream>
#include<unordered_map>
#include<cstdio>
#include<algorithm>
using namespace std;

int main(){
    int coupleCnt;
    int guest[100010] = {0};
    int single[10010] = {0},cnt = 0;
    int a, b;
    unordered_map<int,int> couple;
    cin>>coupleCnt;
    for(int i = 0; i < coupleCnt; i++){
        cin>>a>>b;
        couple[a] = b;
        couple[b] = a;
    }
    int n, qurey[10010];
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>qurey[i];
        guest[qurey[i]]++;
    }
    for(int i = 0; i < n; i++){
        if(guest[couple[qurey[i]]] == 0){
            single[cnt++] = qurey[i];
        }
    }
    sort(single,single+cnt);
    cout<<cnt<<endl;
    for(int i = 0; i < cnt; i++){
        if(i != 0) cout<<" ";
        printf("%05d",single[i]);
    }
    return 0;
}