UVA 11292 The Dragon of Loowater

蓝书……

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A,B)memcpy(A,B,sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fLL;
const double EPS=1e-9;
const double OO=1e20;
const double PI=acos (-1.0);
int dx[]= {0,1,0,-1};
int dy[]= {1,0,-1,0};
int gcd (const LL &a,const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
const int MAX=20010;
int A[MAX],B[MAX];
int main() {
    int n,m;
    while (~scanf ("%d%d",&n,&m) ) {
        if (! (n+m) ) { break; }
        for (int i=0; i<n; ++i) {scanf ("%d",&A[i]);}
        for (int i=0; i<m; ++i) {scanf ("%d",&B[i]);}
        sort (A,A+n); sort (B,B+m);
        int pos=0,ans=0;
        for (int i=0; i<m; ++i) {
            if (B[i]>=A[pos]) {
                ans+=B[i];
                if (++pos==n) { break; }
            }
        }
        if (pos<n) { printf ("Loowater is doomed!\n"); }
        else { printf ("%d\n",ans); }
    }
    return 0;
}