[ACM_水题] UVA 11292 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 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表示有n个头和m个勇士，接下来n个头的战斗力，m歌骑士的战斗力。规定一个骑士只能杀掉一个战斗力不大于其自身战斗力的头，同时要支付给他与战斗力等值的金币，问花费最少为多少，不能杀掉就显示样例2的输出。解题思路：贪心，头和骑士能力从小到大排序，一个一个砍，不能砍掉当前头的骑士就不要。
 1 #include<iostream>
2 #include<algorithm>
3 using namespace std;
4 int main(){
5     int n,m;
6     int heard[20005],power[20005];
7     while(cin>>n>>m){
8         if(n==0 && m==0)return 0;
9         for(int i=0;i<n;i++)cin>>heard[i];
10         for(int j=0;j<m;j++)cin>>power[j];
11         sort(heard,heard+n);
12         sort(power,power+m);
13         int cur=0;
14         int cost=0;
15         for(int i=0;i<m;i++){//从小到大一个一个来砍，不能砍下当前的就不砍
16             if(power[i]>=heard[cur]){
17                 cost+=power[i];
18                 if(++cur == n)break;
19             }
20         }
21         if(cur<n)cout<<"Loowater is doomed!\n";
22         else cout<<cost<<'\n';
23     }return 0;
24 }

|
9月前
|
Java
ACM刷题之路（二十四）HDU 2844 多重背包转换 Coins
ACM刷题之路（二十四）HDU 2844 多重背包转换 Coins
76 0
|
9月前
|
Go
ACM刷题之路（二十二）多重背包转01背包 HDU 1171
ACM刷题之路（二十二）多重背包转01背包 HDU 1171
36 0
|
9月前
|
Go
ACM刷题之路（十五） 分治法 + 找规律 ZOJ4085
ACM刷题之路（十五） 分治法 + 找规律 ZOJ4085
84 0
|

HDU-敌兵布阵（线段树 || 树状数组）
HDU-敌兵布阵（线段树 || 树状数组）
68 0
|

ACM 选手图解 LeetCode 四数相加Ⅱ

104 0
|

ACM 选手图解 LeetCode 模拟法解决螺旋矩阵Ⅱ

115 0
|

ACM 选手图解 LeetCode 有序数组的平方

82 0
UVa 11292 - Dragon of Loowater(排序贪心)
UVa 11292 - Dragon of Loowater(排序贪心)
74 0
[解题报告]《算法零基础100讲》(第14讲) 最小公倍数
[解题报告]《算法零基础100讲》(第14讲) 最小公倍数
92 0

947 0