PAT 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

思路：最后不要输出换行，因为如果单身的人为0的话，会多打印一行，出现格式错诶

程序：

#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main()
{
  int n;
  scanf("%d",&n);
  vector<int> v;
  vector<int> res;
  map<int,int> mymap;
  for(int i = 0; i < n; i++)
  {
    int id1,id2;
    scanf("%d%d",&id1,&id2);
    mymap[id1] = id2;
    mymap[id2] = id1;
  }
  int m;
  scanf("%d",&m);
  for(int i = 0; i < m; i++)
  {
    int id;
    scanf("%d",&id);
    v.push_back(id);
  }
  for(int i = 0; i < m; i++)
  {
    int id = v[i];
    if(mymap.find(id) == mymap.end())
      res.push_back(id);
    else if(find(v.begin(),v.end(),mymap[id]) == v.end())
      res.push_back(id);
  }
  printf("%d\n",res.size());
  sort(res.begin(),res.end());
  for(int i = 0; i < res.size(); i++)
  {
    printf("%05d",res[i]);
    if(i != res.size() - 1)
    {
      printf(" ");
    }
  }
  return 0;
}