UVa 11292 屠龙勇士
来源:互联网 发布:华为算法工程师笔试题 编辑:程序博客网 时间:2024/04/27 14:18
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 numbern of heads that the dragon has, and the number m of knights in the kingdom. The nextn lines each contain an integer, and give the diameters of the dragon's heads, in centimetres. The followingmlines 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!
#include <stdio.h>#include <algorithm>using namespace std;int a[20010], b[20010];int main() {int n, m, cnt = 0, t = 0;while (scanf("%d %d", &n, &m) == 2 && n && m) {int cnt = 0, cost = 0;for (int i = 0; i < n; i++) scanf("%d", &a[i]);for (int i = 0; i < m; i++) scanf("%d", &b[i]);sort(a, a + n);sort(b, b + m);for (int i = 0; i < m; i++) {if (b[i] >= a[cnt]) {cost += b[i];if (++cnt == n) break;}}if (cnt == n)printf("%d\n", cost);elseprintf("Loowater is doomed!\n");}return 0;}
- UVa 11292 屠龙勇士
- (uva 11292)勇士斗恶龙(The Dragon of Loowater)
- UVa 10055 Hashmat the brave warrior(勇士)
- 屠龙宝刀
- 勇士梦
- hashmat10055勇士
- 招勇士
- 倚天屠龙记
- 部落的勇士们
- 火箭負勇士
- 看《三百勇士》
- 电影-300斯巴达勇士
- 勇士与英雄
- “真正的勇士”
- 入手勇士350
- 勇士Hashmat 100055
- 例题1:勇士斗恶龙
- UVA10055 勇士Hashmat
- Tomcat Session管理机制(Tomcat源码解析七)
- URAL2046 The First Day at School
- HDU 1060 Leftmost Digit
- 算法竞赛入门经典:第五章 基础题目选解 5.9 Cantor数
- phpStrom中svn的相关配置
- UVa 11292 屠龙勇士
- [二分图最大匹配] poj 3041 Asteroids
- 白话设计模式之--工厂方法和原型模式
- cv::minMaxLoc()
- Oracle外部表的管理和应用
- 数据结构---树(Python)
- java 多线程(三)条件对象
- Linux电源管理(2)_Generic PM之基本概念和软件架构
- Xcode 6.3新特性:Nullability Annotations