uva11292----Dragon of Loowater

#include<stdio.h>#include<algorithm>using namespace std;int main(){    int n,m;    while(scanf("%d%d",&n,&m)!=EOF)    {        if(n==0&&m==0) break;        int d[20010],q[20010];        for(int i=0;i<n;i++)            scanf("%d",&d[i]);        for(int i=0;i<m;i++)            scanf("%d",&q[i]);        sort(d,d+n);        sort(q,q+m);        int cur=0,cost=0;//第几个龙        int f=0;        for(int i=0;i<m;i++){//最小的骑士开始            if(q[i]>=d[cur]){                cost+=q[i];                cur++;            }            if(cur==n) {f=1;break;}        }        if(f==1) printf("%d\n",cost);        else printf("Loowater is doomed!\n");    }}