ACM——The Dragon of Loowater（UVa 11292）

ter had always been a primebreeding ground for geese. Due to the lack of predators, the geesepopulation was out of control. The people of Loowater mostly kept clearof the geese. Occasionally, a goose would attack one of the people,and perhaps bite off a finger or two, but in general, the peopletolerated the geese as a minor nuisance.

One day, a freak mutation occurred, and one of the geese spawned amulti-headed fire-breathing dragon. When the dragon grew up, he threatenedto burn the Kingdom of Loowater to a crisp. Loowater had a major problem.The king was alarmed, andcalled on his knights to slay the dragon and save the kingdom.

The knights explained: "To slay the dragon, we must chop off all itsheads. Each knight can chop off one of the dragon's heads. The headsof the dragon are of different sizes. In order to chop off a head,a knight must be at least as tall as the diameter of the head.The knights' union demands that for chopping off a head, a knightmust be paid a wage equal to one gold coin for each centimetreof the knight's height."

Would there be enough knights to defeat the dragon? The king called onhis advisors to help him decide how many and which knights to hire.After having lost a lot of money building Mir Park, the king wantedto minimize the expense of slaying the dragon. As one of the advisors,your job was to help the king. You took it very seriously: if you failed,you and the whole kingdom would be burnt to a crisp!

Input Specification:

The input contains several test cases. The first line of each test casecontains two integers between 1 and 20000 inclusive, indicating thenumbern of heads that the dragon has, and the numbermof knights in the kingdom. The nextn lines each contain aninteger, and give the diameters of the dragon's heads, in centimetres.The followingm lines each contain an integer, and specifythe heights of the knights of Loowater, also in centimetres.

The last test case is followed by a line containing:

0 0

Output Specification:

For each test case, output a line containing the minimum number ofgold coins that the king needs to pay to slay the dragon. If it is notpossible for the knights of Loowater to slay the dragon, output theline:

Loowater is doomed!

Sample Input:

2 3
5
4
7
8
4
2 1
5
5
10
0 0

Output for Sample Input:

11
Loowater is doomed!

题意： 
n条龙，m个骑士。
能力值为x的骑士可以砍掉恶龙直径不超过x的头，并需要支付x枚金币。
一个骑士只能杀死一只龙。
求出最少花费。

分析： 
排序是关键按照，能力选择适合的龙和骑士。
/**屠龙勇士，技能为x，只有当x>=龙头的大小的时候，才能够杀死**/
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAX 20005
int knight[MAX],dragon[MAX];
int main()
{
    int m,n;
    /**n个龙，m个骑士**/
    while(scanf("%d%d",&n,&m),n,m)
    {/**输入**/
        for(int i=0;i<n;i++)
            scanf("%d",&dragon[i]);
        for(int i=0;i<m;i++)
            scanf("%d",&knight[i]);
        sort(dragon,dragon+n);
        /**算法核心：排序比较**/
        sort(knight,knight+m);
        int cnt=0,cost=0;
        for(int i=0;i<m;i++)
        {
            /**按照从小到大的顺序，依次找到能够斩杀的龙**/
            if(knight[i]>=dragon[cnt])
                cost+=knight[i];
            if(++cnt==n)break;///杀完及时退出
        }
        if(cnt<n)cout<<"Loowater is doomed!"<<endl;///没有杀完
        else
            cout<<cost<<endl;

    }
    return 0;
}