LA 4636 积木艺术

 1 #include<iostream>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 
 6 const int maxn = 30;
 7 
 8 int vis[maxn];
 9 
10 int n, m;
11 
12 int main()
13 {
14     //freopen("D:\\txt.txt", "r", stdin);
15     int x;
16     while (~scanf("%d%d",&n,&m) && n && m)
17     {
18         int x;
19         int ans = 0;
20         memset(vis, 0, sizeof(vis));
21         for (int i = 0; i < n; i++)
22         {
23             scanf("%d", &x);
24             ans += x;
25             vis[x]++;
26         }
27         for (int i = 0; i < m; i++)
28         {
29             scanf("%d", &x);
30             if (!vis[x])   ans += x;
31             else  vis[x]--;
32         }
33         printf("%d\n", ans);
34     }
35 }