Uva11292--------------(The Dragon of Loowater)勇者斗恶龙 (排序后贪心)

---恢复内容开始---

题目:

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 nlines 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

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!

这种类型的题其实是一种非常基础的问题,我们知道,每一名骑士都有自己的佣金,而佣金越多代表骑士的能力越强,所能斩杀的恶龙的头的直径就越大,所以,我们要尽量保证能力强的骑士斩杀恶龙相对来说比较大的头,而能力一般的骑士斩杀相对直径小一点的头,所以我们需要将恶龙头的直径和骑士的能力由大到小排序,接着作贪心就OK了~!
#include<iostream>
#include<algorithm>
#include<stdio.h>

using namespace std;

#define MAX 20005

int a[MAX];
int b[MAX];

int main(){

    int n ,m ;
    while(cin>>n>>m){
        if(n == 0 && m == 0)
            break;
        for( int i = 0 ; i < n ; i++ )
            cin>>a[i];
        for( int j = 0 ; j < m ; j++ )
            cin>>b[j];
        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];
                cur++;
                if(cur == n)
                    break;
            }
        }
        if(cur < n)
            printf("Loowater is doomed!\n");
        else
            printf("%d\n",cost);
    }
    return 0;
}
时间: 2024-08-11 14:37:00

Uva11292--------------(The Dragon of Loowater)勇者斗恶龙 (排序后贪心)的相关文章

【UVA11292】Dragon of Loowater

C - Dragon of Loowater Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Practice UVA 11292 Appoint description:  System Crawler  (2015-07-27) Description Problem C: The Dragon of Loowater Once upon a time, in the K

uva-----11292 The Dragon of Loowater

Problem C: The Dragon of Loowater 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 predato

UVA11292 HDU1902 POJ3646 Dragon of Loowater

问题链接:UVA11292 HDU1902 POJ3646 Dragon of Loowater. 这个问题是一个典型的贪心法问题,求代价最小. 由于需要用到排序函数,C++的排序函数参数比较简单,所以用C++编程. AC通过的C++语言程序如下: /* UVA11292 HDU1902 POJ3646 Dragon of Loowater */ #include <cstdio> #include <algorithm> using namespace std; #define

UVA 11292 Dragon of Loowater(简单贪心)

Problem C: The Dragon of Loowater 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 predato

11292 - Dragon of Loowater

例题1  勇者斗恶龙(The Dragon of Loowater, UVa 11292) 你的王国里有一条n个头的恶龙,你希望雇一些骑士把它杀死(即砍掉所有头).村里有m个骑士可以雇佣,一个能力值为x的骑士可以砍掉恶龙一个直径不超过x的头,且需要支付x个金币.如何雇佣骑士才能砍掉恶龙的所有头,且需要支付的金币最少?注意,一个骑士只能砍一个头(且不能被雇佣两次). [输入格式] 输入包含多组数据.每组数据的第一行为正整数n和m(1≤n,m≤20 000):以下n行每行为一个整数,即恶龙每个头的直

[2016-03-14][UVA][11292][Dragon of Loowater]

时间:2016-03-14 19:50:12 星期一 题目编号:[2016-03-14][UVA][11292][Dragon of Loowater] 题目大意: 有m个骑士要砍n条龙,每个骑士能看掉龙的头颅当且仅当其实的能力值大于龙的头的直径,每个其实砍掉一条龙需要付出数值上等于能力值的代价,问m个骑士能否砍完所有龙,能则输出最小代价,否则输出"Loowater is doomed!" 输入: 多组数据 每组数据 n m n行 龙头的直径 m行 骑士的能力值 输出: 如果能砍完所有

UVA之11292 Dragon of Loowater

Problem C: The Dragon of Loowater 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 predato

The Dragon of Loowater

The Dragon of Loowater 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 gee

[UVA] 11292 - Dragon of Loowater [贪心+队列]

Problem C: The 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.