uva11292 - Dragon of Loowater

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[20005] ,b[20005];
int main()
{
  //  freopen("1.txt","r",stdin);
    int n,m,ans,flag;
    while(scanf("%d %d",&n,&m)==2 &&n&&m)
    {
        ans=0;
        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 j=0;
        for(int i=0; i<m; i++)
        {
            if(a[j]<=b[i])
            {
                ans+=b[i];
                if(++j==n)
                    break;
            }
        }
        if(j<n)
            cout<<"Loowater is doomed!"<<endl;
        else
            cout<<ans<<endl;
    }
    return 0;
}