UVa 11292 - Dragon of Loowater[贪心]

Once upon a time, in the Kingdom of Loowater, a minor nuisance turnedinto a major problem.

The shores of Rellau Creek in central Loowater had always been a primebreeding ground for geese. Due to the lack of predators, the geesepopulation was out of control. The people of Loowater mostly kept clearof the geese. Occasionally, a goose would attack one of the people,and perhaps bite off a finger or two, but in general, the peopletolerated the geese as a minor nuisance.

One day, a freak mutation occurred, and one of the geese spawned amulti-headed fire-breathing dragon. When the dragon grew up, he threatenedto burn the Kingdom of Loowater to a crisp. Loowater had a major problem.The king was alarmed, andcalled on his knights to slay the dragon and save the kingdom.

The knights explained: "To slay the dragon, we must chop off all itsheads. Each knight can chop off one of the dragon's heads. The headsof 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 knightmust be paid a wage equal to one gold coin for each centimetreof the knight's height."

Would there be enough knights to defeat the dragon? The king called onhis advisors to help him decide how many and which knights to hire.After having lost a lot of money building Mir Park, the king wantedto 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 casecontains two integers between 1 and 20000 inclusive, indicating thenumber n of heads that the dragon has, and the number mof knights in the kingdom. The next n lines each contain aninteger, and give the diameters of the dragon's heads, in centimetres.The following m lines each contain an integer, and specifythe 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 ofgold coins that the king needs to pay to slay the dragon. If it is notpossible for the knights of Loowater to slay the dragon, output theline:

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!

 
/*************************************************************************
	> File Name: uva11292.cpp
	> Author: wjzdmr
	> Mail: wjzdmr@gmail.com
	> Created Time: 2014年09月22日 星期一 17时42分57秒
 ************************************************************************/

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <limits>
#include <fstream>

using namespace std;
//ios_base::sync_with_stdio(0);
#define mem(A, X) memset(A, X, sizeof A)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define foreach(e,x) for(__typeof(x.begin()) e=x.begin();e!=x.end();++e)
#define sz(x) (int)((x).size())
#define sl(a) strlen(a)
#define rep(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define Rep(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define dbg(a) cout << a << endl;
#define fi first
#define se second
typedef long long int64;
int gcd(const int64 &a, const int64 &b) { return b == 0 ? a : gcd(b, a % b); }
int64 int64pow(int64 a, int64 b){ if (b == 0) return 1; int64 t = int64pow(a, b / 2); if (b % 2) return t * t * a; return t * t; }
const int inf = 0x7fffffff;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int MAX_N = 10005;

int n, m, ans;

struct cmp {
    bool operator ()(int &a, int &b) {
        return a > b;//最小值优先
    }
};
void work()
{
    ans = 0;

    priority_queue<int, vector<int>, cmp> qd, ql;

    int elem;
    rep(i, 0, n) {
        scanf("%d", &elem);
        qd.push(elem);
    }
    rep(i, 0, m) {
        scanf("%d", &elem);
        ql.push(elem);
    }

    while (!qd.empty() && !ql.empty()) {
        if (ql.top() >= qd.top()) {
            ans += ql.top();
            ql.pop();
            qd.pop();
        }
        else {
            ql.pop();
        }
    }

    if (qd.empty()) {
        cout << ans << endl;
    }
    else {
        cout << "Loowater is doomed!" << endl;
    }
}
int main()
{
    while (cin >> n >> m && (n || m)) {
        work();
    }
    return 0;
}