uva11292 Dragon of Loowater

Once upon a time, in the Kingdom of Loowater, a mi- nor 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 nger or
two, but in general, the people tolerated the geese as a minor nui-
sance. One day, a freak mu- tation occurred, and one of the
geese spawned a multi-headed re-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 rst 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! ‘.

应该用能力弱的骑士去砍小头，强的骑士去砍大头。所以把骑士能力和头都从小到大排序，每个骑士能砍就砍。因为对于当前骑士，不用他砍的话，就不得不换一个花费更高的砍【如果换一个之前的，那之前那个还得找他来砍】。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[20010],b[20010],n,m;
int main()
{
    int i,j,ans;
    while (scanf("%d%d",&n,&m)&&n)
    {
        for (i=1;i<=n;i++)
          scanf("%d",&a[i]);
        for (i=1;i<=m;i++)
          scanf("%d",&b[i]);
        sort(a+1,a+n+1);
        sort(b+1,b+m+1);
        ans=0;
        for (i=1,j=1;i<=m&&j<=n;i++)
          if (b[i]>=a[j])
          {
            ans+=b[i];
            j++;
          }
        if (j>n) printf("%d\n",ans);
        else printf("Loowater is doomed!\n");
    }
}