uva 11292

做一两个水题怡情一下！

#include<cstdio>
#include<algorithm>
#define maxn 20009
using namespace std;
int a[maxn],b[maxn];

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