ACM: 极其简单题 uva&nb…

Problem C: The Dragon of Loowater

Once upon a time, in the Kingdom of Loowater, a minor nuisanceturned into a major problem.

The shores of Rellau Creek in central Loowater had always been aprime breeding ground for geese. Due to the lack of predators, thegeese population was out of control. The people of Loowater mostlykept clear of the geese. Occasionally, a goose would attack one ofthe 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 spawneda multi-headed fire-breathing dragon. When the dragon grew up, hethreatened to burn the Kingdom of Loowater to a crisp. Loowater hada major problem. The king was alarmed, and called on his knights toslay the dragon and save the kingdom.

The knights explained: "To slay the dragon, we must chop off allits heads. Each knight can chop off one of the dragon's heads. Theheads of the dragon are of different sizes. In order to chop off ahead, a knight must be at least as tall as the diameter of thehead. The knights' union demands that for chopping off a head, aknight must be paid a wage equal to one gold coin for eachcentimetre of the knight's height."

Would there be enough knights to defeat the dragon? The kingcalled on his advisors to help him decide how many and whichknights to hire. After having lost a lot of money building MirPark, the king wanted to minimize the expense of slaying thedragon. As one of the advisors, your job was to help the king. Youtook it very seriously: if you failed, you and the whole kingdomwould be burnt to a crisp!

Input Specification:

The input contains several test cases. The first line of eachtest case contains two integers between 1 and 20000 inclusive,indicating the number n of heads that the dragon has, andthe number m of knights in the kingdom. The next nlines each contain an integer, and give the diameters of thedragon's heads, in centimetres. The following m lines eachcontain an integer, and specify the heights of the knights ofLoowater, 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 numberof gold coins that the king needs to pay to slay the dragon. If itis 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!

题意: 简单贪心题.

解题思路:

     1. 为了纪念第一题uva.

代码:

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX 20005

int n, m;
int a[MAX], b[MAX];

int main()
{
 int i;
// freopen("input.txt", "r", stdin);
 while(scanf("%d %d", &n, &m) != EOF)
 {
  if(n == 0 && m == 0) break;
  for(i = 0; i < n; ++i)
   scanf("%d", &a[i]);
  for(i = 0; i < m; ++i)
   scanf("%d", &b[i]);
  sort(a, a+n);
  sort(b, b+m);

  int cur = 0;
  int sum = 0;
  for(i = 0; i < m; ++i)
  {
   if(b[i] >= a[cur])
   {
    sum += b[i];
    cur++;
    if(cur == n) break;
   }
  }

  if(cur < n) printf("Loowater is doomed!\n");
  else printf("%d\n", sum);
 }
 return 0;
}