PTA-A 1121 Damn Single (25分)

PTA-A 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<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin>>n;
    map<int,int> mp1;
    map<int,int> mp2;
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        mp1[a]=b;
        mp2[b]=a;
    }
    int m;
    cin>>m;
    set<int> guest;
    for(int i=0;i<m;i++){
        int c;
        cin>>c;
        guest.insert(c);
    }
    vector<int> res;
    for(set<int>::iterator it=guest.begin();it!=guest.end();it++){
        if(mp1.find(*it)==mp1.end()&&mp2.find(*it)==mp2.end()){
            res.push_back(*it);
        }
        if(mp1.find(*it)!=mp1.end()&&guest.find(mp1[*it])==guest.end()){
            res.push_back(*it);
        }
        if(mp2.find(*it)!=mp2.end()&&guest.find(mp2[*it])==guest.end()){
            res.push_back(*it);
        }
    }
    cout<<res.size()<<endl;
    for(int i=0;i<res.size();i++){
        printf("%05d",res[i]);
        if(i<res.size()-1){
            cout<<" ";
        }
    }
    return 0;

}