UVA - 11292：Dragon of Loowater

Dragon of Loowater

来源：UVA

标签：排序，贪心算法

参考资料：

相似题目：

题目

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 centimetre of the knight’s height.” Would there be enough knights to defeat the dragon? The king called on his advisors 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 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!

输入

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 he kingdom. The next n lines each contain an integer, and give the diameters of the dragon’s heads, in centimetres. The following m lines each contain an integer, and specify the heights of the knights of Loowater, also in centimetres. The last test case is followed by a line containing ‘0 0’.

输出

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!’.

输入样例

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

输出样例

11
Loowater is doomed!

题目大意

一条恶龙有n个头，杀死这条恶龙必须将它所有的头砍掉。国家现有骑士m人，一个能力值为x的骑士可以砍掉恶龙一个直径不超过x的头，且国家需支付x个金币。问如何雇佣杀死恶龙且支付金币数最少。注：一个骑士只能雇佣一次，且只能砍一个头，每个头只能被砍一次。

参考代码

#include
#include
#define MAXN 20005
using namespace std;
int head[MAXN];
int capc[MAXN];
int n,m;
int main(){
	while(scanf("%d%d",&n,&m) && n+m){
		for(int i=0;i<n;i++){
			scanf("%d",&head[i]);
		}
		for(int i=0;i<m;i++){
			scanf("%d",&capc[i]);
		}
		if(m<n){
			printf("Loowater is doomed!\n");
			continue;
		}
		sort(head,head+n);
		sort(capc,capc+m);
		int ans=0;
		int i=0,j=0;
		while(i<m && j<n){
			if(capc[i]>=head[j]){
				ans+=capc[i];
				i++;
				j++;
			}
			else i++;
		}
		if(j!=n)
			printf("Loowater is doomed!\n");
		else printf("%d\n",ans);
	}
	return 0;
}