UVa-11292 - Dragon of Loowater:简单题

//UVa
#include<cstdio>
#include<ctype.h>
#include<cstring>
#include<fstream>
#include<iostream>
#include<algorithm>
#define LOCAL
using namespace std;
#define maxn 20005
int a[maxn],b[maxn];
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
#endif // LOCAL
    int n,m;
    while(scanf("%d%d",&n,&m)==2){
        if(n==m&&n==0) break;
        int i,j;
        for(i=0; i<n; i++)
            scanf("%d",&a[i]);
        for(i=0; i<m; i++)
            scanf("%d",&b[i]);
        if(n>m){
            printf("Loowater is doomed!\n");
            continue;
        }
        sort(a,a+n);
        sort(b,b+m);
        int ans=0;
        for(i=0,j=0; i<n&&j<m;){
            if(a[i]<=b[j]){
                ans+=b[j];
                i++; j++;
            }
            else j++;
        }
        if(i==n)
            printf("%d\n",ans);
        else
            printf("Loowater is doomed!\n");
    }
    return 0;
}

总结：

第一道原创题···对比了刘书上的代码 思路一样