算法竞赛入门经典 水水水水水

1.1 思维的体操

勇者斗恶龙

骑士能力值和龙直径排序后挨个砍就是了

#include<bits/stdc++.h>
using namespace std;
#define rg register
const int N=20000+55;
int n,m,a[N],b[N],ans=0;

template<class t>void rd(t &x)
{
    x=0;int w=0;char ch=0;
    while(!isdigit(ch)) w|=ch=='-',ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x=w?-x:x;
}

int main()
{
    while(scanf("%d%d",&n,&m)==2&&n&&m)
    {
        ans=0;
        for(rg int i=1;i<=n;++i) rd(a[i]);
        for(rg int i=1;i<=m;++i) rd(b[i]);
        sort(a+1,a+1+n);sort(b+1,b+1+m);
        int cur=1;
        for(rg int i=1;i<=m;++i)
        if(b[i]>=a[cur])
        {
            ans+=b[i],++cur;
            if(cur-1==n) break;
        }
        if(cur<=n) printf("Loowater is doomed!\n");
        else printf("%d\n",ans);
    }
    return 0;
}

突击战