UVA 11389 The Bus Driver Problem(贪心)

2014-11-24 03:23:29 · 作者: · 浏览: 0
[cpp]
#include
#include
using namespace std;
int a[1005],b[1005];
int main(int argc, char *argv[])
{
int n,d,r,i,j,ans;
while(cin>>n>>d>>r&&(n+d+r))
{
for(i=0;i>a[i];
for(i=0;i>b[i];
sort(a,a+n); sort(b,b+n);
for(ans=i=0;i {
if(a[i]+b[n-i-1]>d) ans+=(a[i]+b[n-1-i]-d)*r;
}
cout< }
return 0;
}