UVa 11389 The Bus Driver Problem

题目

UVa 11389 The Bus Driver Problem

题解

又是神奇的贪心，然而我还是想不出来，感觉用费用流能做不过好麻烦啊。药丸药丸。思路感觉很简单，两个数组排序之后大配小，下面是找到的证明：http://www.cnblogs.com/AOQNRMGYXLMV/p/4122236.html

要是省选出贪心题我一定完挂。

代码

//QWsin
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=100+10;

int n,d,r,a[maxn],b[maxn];

inline int cmp(int a,int b){return a>b;}

inline void solve()
{
    for(int i=1;i<=n;++i) scanf("%d",a+i);
    for(int i=1;i<=n;++i) scanf("%d",b+i);
    sort(a+1,a+n+1);
    sort(b+1,b+n+1,cmp);
    int sum=0;
    for(int i=1;i<=n;++i)
        sum+=max(0,a[i]+b[i]-d);
    printf("%d\n",sum*r);
}

int main()
{
    while(scanf("%d%d%d",&n,&d,&r)==3){
        if(!n&&!d&&!r) break;else solve();
    }
    return 0;
}