例题1 勇者斗恶龙 （The Dragon of Loowater,UVa 11292)

#include <iostream>
#include <string.h>
#include <fstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
#define MAXN 20001
int main()
{
    int n,m;
    int d[MAXN],l[MAXN];
    while(scanf("%d%d",&n,&m),n!=0&&m!=0)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&d[i]);
        }
        for(int i=0;i<m;i++)
        {
            scanf("%d",&l[i]);
        }
        if(n>m){printf("Loowater is doomed!\n");continue;}
        sort(d,d+n);
        sort(l,l+m);
        int cost=0;
        int cur=0;
        for(int i=0;i<m;i++)
        {
            if(l[i]>=d[cur])
            {
                cost+=l[i];
                cur++;
                if(cur==n)break;
            }
        }
        if(cur==n)printf("%d\n",cost);
        else printf("Loowater is doomed!\n");
    }

    return 0;
}