UVa 11292 屠龙勇士
2015-08-11 11:12
495 查看
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!
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
mlines 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:
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 next
n lines each contain an integer, and give the diameters of the dragon's heads, in centimetres. The following
mlines 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!
#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); else printf("Loowater is doomed!\n"); } return 0; }
相关文章推荐
- SQL Server 2008 R2的发布订阅配置实践
- android学习笔记NO.1
- 算法竞赛入门经典:第五章 基础题目选解 5.9 Cantor数
- Axis2/c 知识点
- 上传Excel文件使用JXL解析
- Memcache内存分配策略
- Longest Palindromic Substring
- MSYS在Windows上编译的静态库的应用
- 算法竞赛入门经典:第五章 基础题目选解 5.8 字母重排
- WIN7下PS/2等键盘失灵无法使用的解决办法--实测有效
- itext导出word
- 软件工程师的鄙视链
- 牛顿方法(Newton's Method)
- DOM 中 Property 和 Attribute 的区别
- MyBatis-NET
- 移动web开发
- 初始Testlink
- PID
- 关于Apple的Captive Network Assistant
- linux qt5.4.1安装qwt