第一章-问题求解策略-Uva11389-The Bus Driver Problem

分类：贪心
题目链接：Uva11389-The Bus Driver Problem
下午大的配晚上小的

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100+5;
int a[maxn],b[maxn];
bool cp(const int &x,const int &y)
{
    return x>y;
}
int main()
{
    //freopen("stdin.txt","r",stdin);
    //freopen("stdout.txt","w",stdout);
    int n,d,r,ans=0,t;
    while(scanf("%d %d %d",&n,&d,&r)&&(n+d+r))
    {
        ans=0;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0;i<n;i++)
        {
            scanf("%d",&b[i]);
        }
        sort(a,a+n);
        sort(b,b+n,cp);
        for(int i=0;i<n;i++)
        {
            t=a[i]+b[i]-d;
            if(t>0)
            {
                ans+=t;
            }
        }
        printf("%d\n",ans*r);
    }
    return 0;
}