uva11292 Dragon of Loowater

#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
const int MAXN=20000+1000;
int a[MAXN],b[MAXN],vis[MAXN];
int main()
{
    int n,m;
    while(cin>>n>>m&&(n+m)){
        memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int j=0;j<m;j++)
        cin>>b[j];
    sort(a,a+n);
    sort(b,b+m);
    int sum=0;
    int ok=1;
    for(int i=0;i<n;i++)
    {
        int flag=0;
        int j;
        for(j=0;j<m;j++)
        {
            if(b[j]>=a[i]&&!vis[j])
            {
                flag=1;break;
            }
        }
        if(flag)
        {
            vis[j]=1;
            sum+=b[j];
        }
        else {
            ok=0;
            break;
            
        }
    }
    if(ok) cout<<sum<<endl;
    else cout<<"Loowater is doomed!\n";
    }
    return 0;
}