合并车厢

版权声明：来自星空计算机团队(QQ群：134826825)——StarSky_STZG https://blog.csdn.net/weixin_43272781/article/details/88766291

http://47.96.116.66/problem.php?cid=1177&pid=1

http://47.96.116.66/problem.php?cid=1180&pid=1

题解：枚举不动的车箱，其他向不动车厢靠拢

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
ll ans,cnt,flag,temp,sum;
ll a[N],b[N];
char str;
struct node{
    long long l,r;
}e[N];
bool cmp(node a,node b){
    return a.l<b.l;
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){

    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        e[i].l=a[i];
    }
    for(int i=1;i<=n;i++){
        scanf("%lld",&b[i]);
        e[i].r=b[i]+a[i];
    }
    sort(e+1,e+n+1,cmp);
    for(int i=1;i<n;i++){
        a[i]=e[i+1].l-e[i].r;
        //cout<<a[i]<<endl;
    }
    ans=0x3f3f3f3f3f3f;
    for(int i=1;i<=n;i++){
        temp=0;
        for(int j=1;j<i;j++){
            temp+=j*a[j];
        }
        for(int j=i;j<n;j++){
            temp+=(n-j)*a[j];
        }
        ans=min(ans,temp);
    }
    cout<<ans<<endl;

    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}