UVA 11292(p1)----The Dragon of Loowater

#include<bits/stdc++.h>
using namespace std;
const int maxn=20000+50;
int n,m,ans,now;
int hero[maxn];
int dragon[maxn];
int main()
{
    while(scanf("%d%d",&n,&m)==2&&n)
    {
        ans=0;
        now=0;
        for(int i=0; i<n; i++)
            scanf("%d",&dragon[i]);
        for(int i=0; i<m; i++)
            scanf("%d",&hero[i]);
        sort(dragon,dragon+n);
        sort(hero,hero+m);
        for(int i=0; i<m; i++)
        {
            if(hero[i]>=dragon[now])
            {
                now++;
                ans+=hero[i];
                if(now>=n) break;
            }
        }
        if(now<n) printf("Loowater is doomed!\n");
        else printf("%d\n",ans);
    }
    return 0;
}