PAT(甲级)1121

PAT(甲级)1121

1121 Damn Single （25 point(s)）

“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.

题意：

给出N对夫妇，再给出M个参加party的人，求出其中单身狗的个数。

#include<iostream>
#include<set>
#include<string>
using namespace std;
set<int>party;//属于单身狗的party,这里指的是单身狗的party
int partener[100001];
int n,m;
int main(){
    cin>>n;
    int i,j,k;
    for(i=0;i<100000;i++)partener[i]=-1;
    while(n--){
        cin>>i>>j;
        partener[i]=j;
        partener[j]=i;
    }
    cin>>k;
     while(k--){
         cin>>i; //输入00001->输出：1
         if(partener[i]>=0){
             if(party.count(partener[i])){//找到伴侣
                party.erase(partener[i]);//两人一起走出单身party
                 continue;
             }
         }
         party.insert(i);
     }
    cout<<party.size()<<endl;
    for(auto it:party){
        if(it!=*party.begin())cout<<" ";
        printf("%05d",it);
    }
}