【UVA - 11292】Dragon of Loowater

题目链接：https://vjudge.net/problem/uva-11292

简单思维题，自增提前加了WA了两三发。

/*
* @Author: SamsonHo
* @Date:   2018-09-17-15.00.14
* @URL:https://vjudge.net/problem/uva-11292
*/
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 1e5+10;
int dragon[MAXN],atk[MAXN];
int main(void)
{
    int n,m;
    while(~scanf("%d%d",&n,&m) && n+m)
    {
        for(int i = 1; i <= n; ++i)
            scanf("%d",&dragon[i]);
        for(int i = 1; i <= m; ++i)
            scanf("%d",&atk[i]);
        int ans = 0;
        int d = 1,pos = 1;
        sort(dragon+1,dragon+1+n);
        sort(atk+1,atk+1+m);
        for( ; d <= n; ++d)
        {
            for(; pos <= m; ++pos)
            {
                if(atk[pos] >= dragon[d])
                {
                    ans += atk[pos];
                    break;
                }
            }
            if(pos > m)
                break;
            ++pos;
        }

//        for(int i = 1; i <= m; ++i) 大白书写法
//        {
//            if(atk[i] >= dragon[pos])
//            {
//                ans += atk[i];
//                if(++cur > n)   break;
//            }
//        }

        if(d <= n)
            puts("Loowater is doomed!");
        else
            printf("%d\n",ans);
    }
}