题目链接:https://gmoj.net/senior/#main/show/1296
分析
有手就行点贪心。
因为要相差最小,所以很好想到排序,然后补齐计算花费
上代码
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,x,y,up,down,ans;
int a[30000],b[30000];
int main()
{
freopen("sandcas.in","r",stdin);
freopen("sandcas.out","w",stdout);
cin>>n>>x>>y;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&a[i],&b[i]);
}
sort(a+1,a+n+1);
sort(b+1,b+n+1);
for(int i=1;i<=n;i++)
{
if(b[i]>a[i]) up+=b[i]-a[i];
else if(b[i]<a[i]) down+=a[i]-b[i];
}
ans+=up*x+down*y;
cout<<ans;
return 0;
}