UVa-11292 -Dragon of Loowater

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2267

排序就行

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}
int a[20005],b[20005];
int sum;
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,m;
    while(cin>>n>>m)
    {
       if(n==0&&m==0)break;
       for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
       for(int j=1;j<=m;j++)
        scanf("%d",&b[j]);
       sort(a+1,a+1+n);
       sort(b+1,b+1+m);
       if(n>m)cout<<"Loowater is doomed!"<<endl;
       else
       {
           int j=1,i;sum=0;
           for( i=1;i<=m;i++)
           {
               if(b[i]>=a[j]){j++,sum+=b[i];}
               if(j>n)break;
           }
           if(i>m)cout<<"Loowater is doomed!"<<endl;
            else cout<<sum<<endl;
       }
    }
    return 0;
}

   
   

    
    

   
   

细心~