UVa 11292 Dragon of Loowater——思路题

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int maxn = 20000 + 10;

int a[maxn], b[maxn];

int main()
{
int n, m;
while (scanf("%d %d", &n, &m) == 2 && n + m) {
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
sort(a + 1, a + 1 + n);
sort(b + 1, b + 1 + m);
int i, j = 1, ans = 0;
for (int i = 1; i <= m; i++) {
if (b[i] >= a[j]) {
j++;
ans += b[i];
if (j > n) break;
}
}
if (j > n) printf("%d\n", ans);
else printf("Loowater is doomed!\n");
}
}