Dragon of Loowater

原创 2015年07月09日 14:50:25
Dragon of Loowater
Time limit: 1.000 seconds
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 3
5
4
7
8
4



2 1
5
5
10
0 0

Output for Sample Input:

11
Loowater is doomed!


          题目意思是王国里面有一条n个头的恶龙,王国里面有m个骑士可以雇佣,每次雇佣一个能力为x的骑士能砍掉一个直径小于x的头并且需花费x的金币,输入n,m,接着输入n个恶龙头的直径,在输入m个骑士的能力。题目是一个贪心的水题,只需将恶龙头的直径和骑士的能力从小到大排序,取骑士能力的和即为所求最小花费!

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;

int main()
{
    int n, m;
    int elong[20005], qshi[20005];
    while(scanf("%d %d",&n,&m)&&n!=0&&m!=0)
    {
        int sum = 0;
        for(int i = 0; i < n; i++)
            scanf("%d",&elong[i]);
        for(int j = 0 ; j < m; j++)
            scanf("%d",&qshi[j]);
        sort(elong,elong+n);
        sort(qshi,qshi+m);
        int cur = 0;
        for(int i = 0; i < m; i++)
        {
            if(elong[cur] <= qshi[i])
            {
                sum += qshi[i];
                cur++;
                if(cur == n)
                    break;
            }
        }
        if(cur < n)
            printf("Loowater is doomed!\n");
        else
            printf("%d\n",sum);
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

UVa 11292 - Dragon of Loowater(排序贪心)

Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shore...
  • qq_26525215
  • qq_26525215
  • 2016年04月24日 23:41
  • 3498

Dragon of Loowater

Dragon of Loowater Time Limit: 1000MS   Memory Limit: Unknown   64bit IO Format: %lld &...
  • u013102172
  • u013102172
  • 2014年07月23日 18:09
  • 643

The Dragon of Loowater

Description Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major pr...
  • u011292087
  • u011292087
  • 2014年01月16日 15:29
  • 564

Dragon of Loowater 贪心算法

Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The sho...
  • happy_fakelove
  • happy_fakelove
  • 2018年01月09日 22:57
  • 23

sicily 1459 The Dragon of Loowater

// Problem#: 1459 // Submission#: 2720147 // The source code is licensed under Creative Commons Attr...
  • zngufeng
  • zngufeng
  • 2014年03月03日 09:41
  • 342

UVA - 11292 Dragon of Loowater

Dragon of Loowater Time Limit: 1000MS   Memory Limit: Unknown   64bit IO Format: %lld &...
  • acm_1361677193
  • acm_1361677193
  • 2014年08月22日 20:07
  • 318

poj3646 The Dragon of Loowater

The Dragon of Loowater Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: ...
  • u013634213
  • u013634213
  • 2014年08月21日 09:50
  • 477

【UVa】11292 - Dragon of Loowater

ProblemOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. T...
  • LeongHouHeng
  • LeongHouHeng
  • 2016年02月28日 01:43
  • 237

Dragon of Loowater UVA - 11292

传送门 题目大意:有一个恶龙有多个头,勇士雇佣人砍掉他所有的头, 每个勇士的能力为x的话,佣金也为x, 能力为x的勇士能砍掉直径为小于等于x的头。这个勇士想花最少的佣金砍掉恶龙所有的头。每个勇士...
  • lcuwb
  • lcuwb
  • 2017年08月06日 09:17
  • 51

uva 11292The Dragon of Loowater

Once upon a time, in the Kingdom of Loowater, a mi- nor nuisance turned into a major proble...
  • katydid3018
  • katydid3018
  • 2015年08月19日 09:26
  • 124
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Dragon of Loowater
举报原因:
原因补充:

(最多只允许输入30个字)