UVA 11292 - Dragon of Loowater

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int a[20010], b[20010];
int n, m;

int main(){
    #ifdef sxy
        freopen("in.txt", "r", stdin);
    #endif //sxy
    while(~scanf("%d%d",&n,&m)){
        if(!n && !m) break;
        for(int i=0; i<n; i++)
                scanf("%d", &a[i]);
        for(int j=0; j<m; j++)
                scanf("%d", &b[j]);
        if(n>m)    { printf("Loowater is doomed!\n");   continue;}
        sort(a, a+n);
        sort(b, b+m);
        int count = 0,sum = 0;
        for(int i=0; i<m; i++){
                if(b[i] >= a[count]){
                    sum += b[i];
                    count ++;
                }
                if(count == n) break;
        }
        if(count < n)    printf("Loowater is doomed!\n");
        else printf("%d\n", sum);
    }
    return 0;
}