uva 11389 贪心

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;bool cmp1(const int &a,const int &b){return a<b;}bool cmp2(const int &a,const int &b){return b<a;}int d1[1000],d2[1000];int main(){int n,d,r;while(~scanf("%d%d%d",&n,&d,&r)&&n){int res=0;for(int i=0;i<n;i++)scanf("%d",&d1[i]);for(int i=0;i<n;i++)scanf("%d",&d2[i]); sort(d1,d1+n,cmp1);sort(d2,d2+n,cmp2);for(int i=0;i<n;i++){if(d1[i]+d2[i]>d)res+=(d2[i]+d1[i]-d);}printf("%d\n",res*r);}return 0;}