#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
int a[20010], b[20010];
int main() {
int n, m;
while (scanf("%d%d", &n, &m) != EOF) {
if (n == 0 && m == 0) break;
int Min = (~0U >> 2);// printf("%d", Min);
for (int i = 0; i < n; ++ i) {
scanf("%d", &a[i]);
Min = min(a[i], Min);
}
for (int i = 0; i < m; ++ i) {
scanf("%d", &b[i]);
}
sort(a, a + n); sort(b, b + m);
int ans = 0, p = 0;
for (int i = 0; i < m; ++ i) {
if (b[i] >= a[p]) {
ans += b[i];
if ((++ p) >= n) break;
}
}
if (p < n) puts("Loowater is doomed!");
else printf("%d\n", ans);
}
}
UVA11292 - Dragon of Loowater
最新推荐文章于 2019-07-03 07:20:17 发布