UVA 题目11292 Dragon of Loowater
来源:互联网 发布:网络小说 毒 知乎 编辑:程序博客网 时间:2024/06/08 03:00
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 3547842 155100 0
Output for Sample Input:
11Loowater is doomed!
/********************************** 日期:2013-4-19* 作者:SJF0115* 题号: 题目11292 - Dragon of Loowater* 来源:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2267* 结果:AC* 来源:UVA* 总结:**********************************/#include<stdio.h>#include<stdlib.h>int Dragon[20001],Knights[20001];//排序函数int cmp(const void *a,const void *b){return *(int *)a - *(int *)b;}int main (){int i,j,N,M,cost,index;//freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin); while(scanf("%d %d",&N,&M) != EOF){if(N == 0 && M == 0){break;}//金币cost = 0;index = 0;//头for(i = 0;i < N;i++){scanf("%d",&Dragon[i]);}//勇士for(i = 0;i < M;i++){scanf("%d",&Knights[i]);}//排序qsort(Dragon,N,sizeof(int),cmp);qsort(Knights,M,sizeof(int),cmp);//贪心for(i = 0;i < M;i++){if(index >= N){break;}if(Knights[i] >= Dragon[index]){//统计所花金币cost += Knights[i];index++;}}//输出if(index >= N){printf("%d\n",cost);}else{printf("Loowater is doomed!\n");}}return 0;}
- UVA 题目11292 Dragon of Loowater
- UVA 题目11292 Dragon of Loowater
- uva --11292 --Dragon of Loowater
- UVa 11292 - Dragon of Loowater
- uva - 11292 - Dragon of Loowater
- UVA 11292 - Dragon of Loowater
- uva 11292 - Dragon of Loowater
- Uva-11292-Dragon of Loowater
- UVA 11292 - Dragon of Loowater
- UVA 11292 Dragon of Loowater
- uva 11292 - Dragon of Loowater
- UVA 11292 - Dragon of Loowater
- UVA 11292 Dragon of Loowater
- UVA 11292 Dragon of Loowater
- UVa 11292 Dragon of Loowater
- UVa 11292 Dragon of Loowater
- UVA 11292 Dragon of Loowater
- uva 11292 Dragon of Loowater
- 打开word时,出现“向程序发送命令时出现问题”的解决方法
- unix网络编程(笔记一)
- Maven常用命令
- 免费 SVN 服务器收集
- curl
- UVA 题目11292 Dragon of Loowater
- 使用XPATH查找xml文档节点
- 实验验证kvm VM 线程机制
- C#Winform开发,Listview根据文件路径或扩展名显示系统文件图标
- 两种改变matlab默认工作目录的方法
- ATL持续化之IPersistPropertyBag
- 用函数的方法来显示数据库的记录集div
- java中equals和==的区别
- Java堆内存的10个要点