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 <cstring>
#include <algorithm>
#include <unordered_set>

using namespace std;

const int N = 50010, M = 10010;

struct Couple
{
    int a, b;
}c[N];
int ans[M];

int main()
{
    int n, m;
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ ) scanf("%d%d", &c[i].a, &c[i].b);

    scanf("%d", &m);
    unordered_set<int> S;
    for (int i = 0; i < m; i ++ )
    {
        int id;
        scanf("%d", &id);
        S.insert(id);
    }

    for (int i = 0; i < n; i ++ )
    {
        int a = c[i].a, b = c[i].b;
        if (S.count(a) && S.count(b))
        {
            S.erase(a);
            S.erase(b);
        }
    }

    int k = 0;
    for (auto id : S) ans[k ++ ] = id;
    sort(ans, ans + k);

    printf("%d\n", k);

    if (k)
    {
        printf("%05d", ans[0]);
        for (int i = 1; i < k; i ++ ) printf(" %05d", ans[i]);
    }

    return 0;
}