UVA-11292

UVA-11292    The Dragon of Loowater

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
    int n,m,ans;
    int dragon[20000],worrior[20000];
    bool ANS;
    while(scanf("%d%d",&n,&m)==2){
        if(n==0 && m==0)
            break;
        for(int i=0;i<n;i++){
            scanf("%d",&dragon[i]);
        }
        for(int i=0;i<m;i++){
            scanf("%d",&worrior[i]);
        }
        ans=0;ANS=false;
        if(n>m)
            printf("Loowater is doomed!\n");
        else{
            sort(dragon,dragon+n);
            sort(worrior,worrior+m);
            if(dragon[n-1]>worrior[m-1]){
                printf("Loowater is doomed!\n");
                break;
            }
            int count=0;
            for(int i=0;i<n;i++){
                ANS=false;
                for(int j=count;j<m;j++){
                    if(dragon[i]<=worrior[j]){
                        count=j+1;
                        ans+=worrior[j];
                        ANS=true;
                        break;
                    }
                }
                if(!ANS)
                    break;                
            }
            if(!ANS)
                printf("Loowater is doomed!\n");
            else
                printf("%d\n",ans);
        }
    }
    
    
return 0;
}

不知道為什麼，一開始送的時候一直RE= =