UVA11292 勇士鬥惡龍 -- 貪心算法

#include <cstdio>
#include <algorithm>
#define MAXN 20005
using namespace std;
int a[MAXN],b[MAXN];

int main()
{
    int n,m;
    while (scanf("%d%d",&n,&m) == 2 && n && m)
    {
        /* code */
        for(int i = 0;i < n;i++)
            scanf("%d",&a[i]);
        for(int i = 0;i < m;i++)
            scanf("%d",&b[i]);
        int p1,p2;
        p1 = p2 = 0;
        sort(a,a+n);
        sort(b,b+m);
        int cost = 0;
        while(true) {
            if(p2>=m || p1>=n) break;
            if(a[p1] <= b[p2]) {
                cost += b[p2++];
                p1++;
            } else {
                p2++;
            }
        }
        
        if(p1==n) {
            printf("%d\n",cost);
        } else {
            printf("Loowater is doomed!\n");
        }
        
    }
    



    return 0;
}