# Dragon of Loowater

Dragon of Loowater
Time limit: 1.000 seconds
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!

### 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 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 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!


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的金币，输入n，m，接着输入n个恶龙头的直径，在输入m个骑士的能力。题目是一个贪心的水题，只需将恶龙头的直径和骑士的能力从小到大排序，取骑士能力的和即为所求最小花费！

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;

int main()
{
int n, m;
int elong[20005], qshi[20005];
while(scanf("%d %d",&n,&m)&&n!=0&&m!=0)
{
int sum = 0;
for(int i = 0; i < n; i++)
scanf("%d",&elong[i]);
for(int j = 0 ; j < m; j++)
scanf("%d",&qshi[j]);
sort(elong,elong+n);
sort(qshi,qshi+m);
int cur = 0;
for(int i = 0; i < m; i++)
{
if(elong[cur] <= qshi[i])
{
sum += qshi[i];
cur++;
if(cur == n)
break;
}
}
if(cur < n)
printf("Loowater is doomed!\n");
else
printf("%d\n",sum);
}
return 0;
}

#### UVa 11292 - Dragon of Loowater(排序贪心)

2016-04-24 23:41:46

#### uva 11292 Dragon of Loowater （勇者斗恶龙系列）

2015-01-22 19:59:40

#### The Dragon of Loowater

2014-01-16 15:29:12

#### HDU 1902 The Dragon of Loowater

2014-09-16 14:35:51

#### POJ-3646 The Dragon of Loowater

2015-05-16 23:35:25

#### UVA 11292 - Dragon of Loowater

2015-09-06 15:02:07

#### UVa 11292 Dragon of Loowater

2013-11-25 18:40:04

#### POJ 3646 Dragon of Loowater

2014-04-29 22:22:38

#### uva11292 Dragon of Loowater 水题

2014-05-12 21:30:19

#### UVA - 11292 Dragon of Loowater

2014-08-22 20:07:39