#include<cstdio> #include<algorithm> #include<map> #include<set> #include<vector> using namespace std; vector<int> lonely; vector<int> guests; map<int,int> couple; int hascome[100100]={0}; int main(){ int n,i,m; scanf("%d",&n); int id1,id2; for(i=0;i<n;i++){ scanf("%d%d",&id1,&id2); couple[id1]=id2; couple[id2]=id1; } scanf("%d",&m); int idtemp; int num=0; for(i=0;i<m;i++){ scanf("%d",&idtemp); hascome[idtemp]=1; guests.push_back(idtemp); } for(i=0;i<m;i++){ if(couple.count(guests[i])==0){ num++; lonely.push_back(guests[i]); }else if(hascome[couple[guests[i]]]==0){ num++; lonely.push_back(guests[i]); } } sort(lonely.begin(),lonely.end()); printf("%d\n",num); for(i=0;i<num;i++){ if(i<num-1) printf("%05d ",lonely[i]); else printf("%05d\n",lonely[i]); } system("pause"); return 0; }
PAT A1121 damn single (25)
最新推荐文章于 2020-11-28 19:30:27 发布