UVa 11292 贪心

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=2e4+10;
int f
,sz
,hero
,
n,m;
int main() {
while(scanf("%d%d",&n,&m)&&(m||n)) {
fo(i,0,n-1) scanf("%d",&sz[i]);
fo(i,0,m-1) scanf("%d",&hero[i]);
sort(sz,sz+n);
sort(hero,hero+m);
int cur=0,tot=0;
fo(i,0,m-1) {
if(hero[i]>=sz[cur]) {
tot+=hero[i];
if(++cur==n) break;
}
}
if(cur<n) printf("Loowater is doomed!\n");
else printf("%d\n",tot);
}
return 0;
}