uva-----11292 The Dragon of Loowater

Problem C: The Dragon of Loowater

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!

题目的大意是 一条大恶龙有很多头，然后你将要派出一些骑士去斩下恶龙的头，每一位骑士只能斩获一个头，但是每派出一个骑士就需要支付一定的货币
，然后问有没有可能斩下所有恶龙的头，若能，最少需要支付多少货币.......!```
``` 1 #include<cstdio>
2 #include<algorithm>
3 using namespace std;
4
5 const int maxn =20000+5;
6 int A[maxn] , B[maxn];
7 int main()
8 {
9     int n,m,i;
10     while(scanf("%d%d",&n,&m)==2&&n&&m)
11     {
12        for(i=0 ; i<n ;i++)
13           scanf("%d",&A[i]);
14        for(i=0 ; i<m ;i++)
15           scanf("%d",&B[i]);
16        sort(A,A+n); //对A进行从小到大排序
17        sort(B,B+m); //对B进行从小到大排序
18       int cur=0;
19       int cost=0;
20       for(i=0;i<m;i++)
21       {
22         if(B[i]>=A[cur])
23         {
24           cost+=B[i];
25           cur ++ ;
26           if(cur == n ) break;
27         }
28       }
29       if(cur<n)
30            printf("Loowater is doomed!\n");
31         else
32            printf("%d\n",cost);
33     }
34 }```

0 条评论

• hdu-----(3746)Cyclic Nacklace（kmp）

Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32...

• hdu-----(1179)Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)

Ollivanders: Makers of Fine Wands since 382 BC. Time Limit: 2000/1000 MS (Java/O...

Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...

• UVA 11292 Dragon of Loowater(简单贪心)

Problem C: The Dragon of Loowater Once upon a time, in the Kingdom of Loowater, ...

• Codeforce 1102 C. Doors Breaking and Repairing

You are policeman and you are playing a game with Slavik. The game is turn-based...

• 结合人类和机器智能，利用社会媒体图像进行快速损伤评估（CS SI)

快速损失评估是应对组织在灾害发生时执行的核心任务之一，目的是了解道路、桥梁和建筑物等基础设施的损失程度。 这项工作分析了社会媒体图像内容的有用性，以执行快速损害...

• 使用深度学习序列预测光伏发电，并注意序列模型（CS）

（住宅）光伏（PV）电力作为分布式能源的普及率不断提高，给电力基础设施带来了许多挑战。我们迫切需要高质量、通用的工具来提供准确的电力生产预测。在本文中，我们提出...

There are a few principal functions readingdata into R.

• Instant Messaging at LinkedIn: Scaling to 10000 of Connections

We recently introduced Instant Messaging on LinkedIn, complete with typing indic...

• 原创译文 | 难民身份认证难？区块链来解决

本文为灯塔大数据原创内容，欢迎个人转载至朋友圈，其他机构转载请在文章开头标注：“转自：灯塔大数据；微信：DTbigdata”