1.勇者斗恶龙

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;

const int maxn = 200000;
int A[maxn],B[maxn];
int main()
{
    int n=0,m=0;
    while(scanf("%d %d",&n,&m)==2 && n && m)
    {
        for(int i =0; i < n; i++){ scanf("%d",&A[i]);}
        for(int i =0; i < m; i++){ scanf("%d",&B[i]);}
        sort(A,A+n);
        sort(B,B+m);
        int cur = 0;
        int cost = 0;

        for(int i = 0; i < m; i++)
        if(B[i] >= A[cur]){
            cost += B[i];
            if(++cur == n) break;
        }
        if(cur < n) printf("LooWater is doomed!\n");
        else printf("%d\n",cost);
    }
    return 0;
}