1121 Damn Single(单身狗)

 英文题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805352359378944

中文题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805266942377984

 1 #include<iostream>
 2 #include<vector>
 3 #include<algorithm>
 4 using namespace std;
 5 
 6 const int maxn = 100010;
 7 int hashtable[maxn];
 8 int main() {
 9     int n,a,b,m;
10     cin>>n;
11     for(int i = 0; i < n; ++i) {
12         cin>>a>>b;
13         hashtable[a] = b;
14         hashtable[b] = a;
15     }
16     cin>>m;
17     n = m;
18     vector<int> v(m);
19     for(int i = 0; i < m; ++i)
20         cin>>v[i];
21     for(int i = 0; i < m; ++i) {
22         for(int j = i+1; j < m; ++j) {
23             if(v[i] == hashtable[v[j]]) {
24                 v[i] = v[j] = maxn;
25                 n-=2;
26                 break;
27             }
28         }
29     }
30     cout<<n<<endl;
31     sort(v.begin(),v.end());
32     for(int i = 0 ; i < n; ++i) {
33         if(i > 0) printf(" ");
34         printf("%05d",v[i]);
35     }
36     return 0;
37 }

 

posted @ 2020-03-19 11:05  tangq123  阅读(146)  评论(0)    收藏  举报