UVa LA 4636 Cubist Artwork 难度: 0

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAXN = 1e3 + 3;
typedef pair<int, int> Pair;
int n, m;
int a[MAXN], b[MAXN];
int main() {
    int T;
    //scanf("%d", &T);
    freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\input.txt", "r", stdin);
    //freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\output.txt", "w", stdout);
    for (int ti = 1; scanf("%d%d", &n, &m) == 2 && n && m; ti++) {
        for (int i = 0; i < n; i++) {
            scanf("%d", a + i);
        }
        sort(a, a + n);
        for (int i = 0; i < m; i++) {
            scanf("%d", b + i);
        }
        sort(b, b + m);
        int ans = 0;
        for (int i = n - 1, j = m - 1; i >= 0 || j >= 0;) {
            if (i < 0) {
                ans += b[j--];
            }
            else if (j < 0) {
                ans += a[i--];
            }
            else {
                if (a[i] == b[j]) {
                    ans += a[i];
                    i--; j--;
                }
                else if (a[i] > b[j]) {
                    ans += a[i--];
                }
                else {
                    ans += b[j--];
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}