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!

Sample Input:

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 条评论
登录 后参与评论

相关文章

来自专栏ml

hdu 1805Expressions(二叉树构造的后缀表达式)

Expressions Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 ...

36360
来自专栏函数式编程语言及工具

Akka(40): Http:Marshalling reviewed - 传输数据序列化重温

   上篇我们讨论了Akka-http的文件交换。由于文件内容编码和传输线上数据表达型式皆为bytes,所以可以直接把文件内容存进HttpEntity中进行传递...

26080
来自专栏ml

hduoj------2594 Simpsons’ Hidden Talents

Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others)    Memory Limit:...

27940
来自专栏小樱的经验随笔

HDU 5882 Balanced Game

Balanced Game Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/3276...

36490
来自专栏ml

poj-----(2828)Buy Tickets(线段树单点更新)

Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 1...

398120
来自专栏函数式编程语言及工具

Akka(34): Http:Unmarshalling,from Json

  Unmarshalling是Akka-http内把网上可传输格式的数据转变成程序高级结构话数据的过程,比如把Json数据转换成某个自定义类型的实例。按具体流...

24970
来自专栏扎心了老铁

Hadoop通过HCatalog编写Mapreduce任务访问hive库中schema数据

1、dirver package com.kangaroo.hadoop.drive; import java.util.Map; import java.u...

76950
来自专栏码匠的流水账

聊聊reactive streams的backpressure

这样一个生产流水线,有个要求就是每个环节的处理要能够协调,就像电影起跑线里头男主角去工厂打工,流水线花花往他那边推送货物,他速度跟不上,导致货物都掉地上了,最后...

12410
来自专栏移动开发的那些事儿

startActivity的Hook之路

由上可知,最终是通过ActivityThread里面的mInstrumentation对象来执行execStartActivity,而ActivityThrea...

16320
来自专栏用户2442861的专栏

Good logging practice in Python

https://fangpenlin.com/posts/2012/08/26/good-logging-practice-in-python/

16810

扫码关注云+社区

领取腾讯云代金券