Dragon of Loowater（贪心+排序）

Once upon a time, in the
Kingdom of Loowater, a mi-
nor 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 nui-
sance.
One day, a freak mu-
tation 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!
Input
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 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’.
Output
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
Sample Output
11
Loowater is doomed!

第一次看这个题干的时候，就感觉好长啊。就没心情做了。但是仔细看看，提议真的很简单，就是题干把我们唬住了。
题意：有m个勇士和n条恶龙。每一个勇士只能杀一条龙，而且不大于自己能力价值的龙。杀一条龙就耗费自己能力值的金币，问杀死所有的龙最少需要耗费多少金币。
将两组数据有小到大排序，看看最后能不能杀死所有的龙就好了
代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int maxx=1e5+10;
int n,m;
int a[maxx];
int b[maxx];

int main()
{
	while(scanf("%d%d",&n,&m),n+m)
	{
		for(int i=0;i<n;i++) scanf("%d",&a[i]);
		for(int i=0;i<m;i++) scanf("%d",&b[i]);
		sort(a,a+n);
		sort(b,b+m);
		int i,j;
		int ans=0;
		for(i=0,j=0;i<n;i++,j++)
		{
			while(j<m&&b[j]<a[i]) j++;
			if(j>=m) break;
			ans+=b[j];
		}
		if(i<n) printf("Loowater is doomed!\n");
		else printf("%d\n",ans);
	}
}

努力加油a啊，(^o)/~