UVA11292 The Dragon of Loowater
来源:互联网 发布:两晋通俗演义 知乎 编辑:程序博客网 时间:2024/05/07 13:49
The Dragon of Loowater
Once upon a time, in the Kingdom of Loowater, a minor nuisance turnedinto a major problem.The shores of Rellau Creek in central Loowater had always been a primebreeding ground for geese. Due to the lack of predators, the geesepopulation was out of control. The people of Loowater mostly kept clearof the geese. Occasionally, a goose would attack one of the people,and perhaps bite off a finger or two, but in general, the peopletolerated the geese as a minor nuisance.
One day, a freak mutation occurred, and one of the geese spawned amulti-headed fire-breathing dragon. When the dragon grew up, he threatenedto burn the Kingdom of Loowater to a crisp. Loowater had a major problem.The king was alarmed, andcalled on his knights to slay the dragon and save the kingdom.
The knights explained: "To slay the dragon, we must chop off all itsheads. Each knight can chop off one of the dragon's heads. The headsof 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 knightmust be paid a wage equal to one gold coin for each centimetreof the knight's height."
Would there be enough knights to defeat the dragon? The king called onhis advisors to help him decide how many and which knights to hire.After having lost a lot of money building Mir Park, the king wantedto 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 casecontains two integers between 1 and 20000 inclusive, indicating thenumbern of heads that the dragon has, and the numbermof knights in the kingdom. The nextn lines each contain aninteger, and give the diameters of the dragon's heads, in centimetres.The followingm lines each contain an integer, and specifythe 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 ofgold coins that the king needs to pay to slay the dragon. If it is notpossible for the knights of Loowater to slay the dragon, output theline:
Loowater is doomed!
Sample Input:
2 3547842 155100 0
Output for Sample Input:
11Loowater is doomed!解题思路:贪心算法,尽量节省钱,每个头都检索勇士,由价钱从低到高,能完成,则交个他任务,否则,无法杀死龙。#include<cstdio>#include<algorithm>using namespace std;int main(){ int n,m; int i,j; int sum,sum1; int dra[20002],nam[20002]; while(scanf("%d%d",&n,&m)&&n||m) { sum=0; sum1=0; for(i=0;i<n;i++) scanf("%d",&dra[i]); sort(dra,dra+n); for(j=0;j<m;j++) scanf("%d",&nam[j]); sort(nam,nam+m); j=0; for(i=0;i<n;i++) for(;j<m;j++) //由大到小,逐个比较,能用则用,尽量节省 if(dra[i]<=nam[j]) { sum++; sum1+=nam[j]; j++; break; } if(sum==n) printf("%d\n",sum1); else printf("Loowater is doomed!\n"); } return 0;}
- UVA11292 The Dragon of Loowater
- UVA11292-The Dragon of Loowater
- Uva11292 The Dragon of Loowater
- uva11292 The Dragon of Loowater
- UVA11292 The Dragon of Loowater
- uva11292 - The Dragon of Loowater (贪心)
- uva11292 Dragon of Loowater
- UVA11292:Dragon of Loowater
- UVa11292 Dragon of Loowater
- uva11292 - Dragon of Loowater
- UVA11292-Dragon of Loowater
- UVa11292 - Dragon of Loowater
- uva11292 Dragon of Loowater
- uva11292 - Dragon of Loowater
- uva11292----Dragon of Loowater
- uva11292-Dragon of Loowater
- UVa11292-Dragon of Loowater
- uva11292 Dragon of Loowater
- ABAP - 3D Graphs with SAP
- 判断Windows版本 和 是否为64Bit
- 最大子序列
- Android 异步任务——AsyncTask (附Demo下载)
- iOS常用开源项目
- UVA11292 The Dragon of Loowater
- 一个序列里的数字都是成对的,只有一个是单个的,找出来。
- CodeForces Round #191 (327C) - Magic Five 乘法逆元与费马小定理
- ORB算法
- ABAP--如何生成SAP系统ABAP标准课程涉及到的数据表无数据的问题
- jquery validator addMethod 方法的使用
- fg、bg、jobs、&、ctrl + z等linux命令简介
- 最好用的 unity3d Json数据传输,插件JsonFx !!
- 如何 修改RAILS的默认错误提示 和 Rails validation error message 相关的合集