The Dragon of Loowater

Description

Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.

The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the geese population was out of control. The people of Loowater mostly kept clear of the geese. Occasionally, a goose would attack one of the people, and perhaps bite off a finger or two, but in general, the people tolerated the geese as a minor nuisance.

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

The knights explained: "To slay the dragon, we must chop off all its heads. Each knight can chop off one of the dragon's heads. The heads of 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 knight must be paid a wage equal to one gold coin for each centimeter of the knight's height."

Would there be enough knights to defeat the dragon? The king called on his advisers to help him decide how many and which knights to hire. After having lost a lot of money building Mir Park, the king wanted to minimize the expense of slaying the dragon. As one of the advisers, 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 case contains two integers between 1 and 20000 inclusive, indicating the number n of heads that the dragon has, and the number m of knights in the kingdom. The next n lines each contain an integer, and give the diameters of the dragon's heads, in centimeters. The following m lines each contain an integer, and specify the heights of the knights of Loowater, also in centimeters.

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 of gold coins that the king needs to pay to slay the dragon. If it is not possible for the knights of Loowater to slay the dragon, output the line:

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!

解题思路：国王既想把龙的头都砍下来，并且要雇佣勇士的钱花的最少，利用贪心法。把勇士的能力值、龙的头均按从小到大排列（快排——qsort），然后可以从两个角度来看——头的角度和勇士的角度。

解法一（头的角度）：

  这个是自己当时考虑的时候想出的方法。从龙的头的角度来看，如果头的个数多于勇士的个数则龙不会被杀死；反之，要看每一个头是否能找到一个勇士来砍掉它，找到一个就砍掉这个头看下一个头，如果都能找到则龙可以被杀死，只要有一个头没找到，龙就不会被杀死。代码如下：

#include<iostream>
#include<cstdio>
#include<stdlib.h>
int N[20000];
int M[20000];
using namespace std;
int cmp(const void *a,const void *b)
{
	return *(int*)a-*(int*)b;
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)==2&&(m||n))
	{
	<span style="white-space:pre">	</span>for(int i=0;i<n;i++) scanf("%d",&N[i]);
		for(int i=0;i<m;i++) scanf("%d",&M[i]);
		qsort(N,n,sizeof(int),cmp);   //注意这里第二个参数是“n”不是“20000”
		qsort(M,m,sizeof(int),cmp);
		int fl=0,x=0;
		for(int i=0;i<n;i++)
		{
			if(fl==m)
			{
				cout<<"Loowater is doomed!"<<endl;
				break; 
			}
			for(int j=fl;j<m;j++)
			{
				if(N[i]<=M[j])
				{
					x+=M[j];
					fl=j+1;  //下次从下一个勇士开始找
					if(i==(n-1)) cout<<x<<endl;
					break;
				}
				if(j==m-1) fl=m;
			}
		}
	}
	return 0;
}

解法二：（勇士的角度）

  头是一个一个被勇士砍掉的，只要最后被砍下的头的数量等于龙的头的个数，龙就死了，否则龙没有死。代码如下：

#include<iostream>
#include<cstdio>
#include<stdlib.h>
int N[20000];
int M[20000];
using namespace std;
int cmp(const void *a,const void *b)
{
	return *(int*)a-*(int*)b;
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)==2&&(m||n))
	{
		for(int i=0;i<n;i++) scanf("%d",&N[i]);
		for(int i=0;i<m;i++) scanf("%d",&M[i]);
		qsort(N,n,sizeof(int),cmp);
		qsort(M,m,sizeof(int),cmp);
		int x=0,j=0;
		for(int i=0;i<m;i++)
		{
			if(M[i]>=N[j])
			{
				x+=M[i];
				j++;
			}
			if(j==n)
			{
				cout<<x<<endl;
				break;
			}
	    }
	    if(j<n)	cout<<"Loowater is doomed!"<<endl; 
	}
	return 0;
}