ZOJ3646 The Dragon of Loowater
2015-09-26 21:09
567 查看
The Dragon of Loowater
Description
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
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
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
Sample Output
Source
Waterloo Local Contest, 2007.9.29
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 20000+5;
int A[maxn], B[maxn];
int main()
{
int n,m,i;
while(scanf("%d%d",&n,&m)==2 && n && m)
{
for(i = 0;i<n;i++)
{
scanf("%d",&A[i]);
}
for(i = 0;i<m;i++)
{
scanf("%d",&B[i]);
}
sort(A,A+n);
sort(B,B+m);
int cur = 0;
int cost = 0;
for(int i = 0;i<m;i++)
{
if(B[i]>=A[cur])
{
cost+=B[i];
if(++cur==n) break;
}
}
if(cur<n) printf("Loowater is doomed!\n");
else printf("%d\n",cost);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 3477 | Accepted: 1759 |
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
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
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
Sample Output
11 Loowater is doomed!
Source
Waterloo Local Contest, 2007.9.29
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 20000+5;
int A[maxn], B[maxn];
int main()
{
int n,m,i;
while(scanf("%d%d",&n,&m)==2 && n && m)
{
for(i = 0;i<n;i++)
{
scanf("%d",&A[i]);
}
for(i = 0;i<m;i++)
{
scanf("%d",&B[i]);
}
sort(A,A+n);
sort(B,B+m);
int cur = 0;
int cost = 0;
for(int i = 0;i<m;i++)
{
if(B[i]>=A[cur])
{
cost+=B[i];
if(++cur==n) break;
}
}
if(cur<n) printf("Loowater is doomed!\n");
else printf("%d\n",cost);
}
return 0;
}
相关文章推荐
- ZOJ 1045 HangOver
- golang+litide+ubuntu环境配置
- google-analytics.com
- GO 学习笔记 (一)
- vs2013编译g3dlite时出现 min不是std的成员 mangos
- 推荐十款超赞的Google Chrome扩展插件
- poj2817状态压缩DP
- UVa 11292:Dragon of Loowater(水题)
- The Knuth-Morris-Pratt Algorithm
- OC 类目(category) 延展(extension) 协议(protocol)
- the heapsort algorithm
- Going asynchronous: from Flask to Twisted Klein
- Golang基于学习总结
- OC基础-Category的用法
- django实现文件上传
- POJ3623:Best Cow Line, Gold(后缀数组)
- Django模板中日期过滤器的问题
- golang使用interface来mock进行测试(来自dotGO2014)
- 网页中调用Google地图
- 最大生成树POJ2263Heavy Cargo解题报告