UVA 11292 The Dragon of Loowater（排序问题系列）

/*
The Dragon of Loowater
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2267
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!
Ond?ej Lhoták

*/

/*

题意：

1.每个士兵只能杀一个头，只有龙头全被杀掉后才算成功,国家才能不被灭亡。所以，士兵数要大于等于头的数目。

2.龙的每个头都有一个高度。每个士兵只能杀掉高度小于等于他自己身高的头。

3.如果说士兵的数目大于等于龙头的个数，但是士兵的身高大于等于龙头的高度的士兵 数小于龙头的个数，这也是不能成功屠龙的。

4.对于符合要求的士兵，国王奖励他本身身高数值数目的金钱；

5.求国王所需付的金钱最少的数目。

*/

/*

思路：

  将所给的龙头以及士兵的身高排一下序，然后再筛选掉就可以了。

*/

#include<cstdio>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using  namespace std;
#define M  20010
int an[M];
int bm[M];
int cmp(int a,int b)
{
 return a<b;
}


int main()
{
int n,m;
while(scanf("%d%d",&n,&m),(n||m))
{
memset(an,0,sizeof(an));
memset(bm,0,sizeof(bm));
int i,j,k;
for(i=0;i<n;i++)
  scanf("%d",&an[i]);
  for(j=0;j<m;j++)
  scanf("%d",&bm[j]);
  
  sort(an,an+n,cmp);
  sort(bm,bm+m,cmp);
  if(n>m)
    printf("Loowater is doomed!\n");
else
{
 int sum=0,count=0;
for(j=0,i=0;i<n&&j<m;i++)
{
   while(an[i]>bm[j])//去掉龙的身高大于士兵的身高的个数
     {
  count++;
     j++ ;
     }
     sum+=bm[j];
     j++;
}
     if(count<=m-n)//只有当所有的龙的能被屠杀才算成功
printf("%d\n",sum);
else
 printf("Loowater is doomed!\n");
}
}
return 0;
}