知识点:贪心,
比较简单的贪心,两个都排序,然后找就行了,对于每个龙,都找大于等于它但是大的最小的骑士,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 20005;
int a[N], b[N];
int main() {
int n, m;
while (cin >> n >> m && n) {
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
sort(a, a + n);
sort(b, b + m);
int cur = 0;
int ook = 1;
int ans = 0;
for (int i = 0; i < n; i++) {
while (cur < m && b[cur] < a[i]) cur++;
if (cur == m) { ook = 0; break; }
ans += b[cur++];
}
if (ook) cout << ans << endl;
else cout << "Loowater is doomed!" << endl;
}
return 0;
}