#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define all(v) v.begin(),v.end()
vector<pii> a;
int n;
int comp[200005];
pii range[200005];
ll dp[200005],pref[200005],suff[200005];
const ll INF = 1e14;
ll min_total_length(vi r, vi b) {
for(auto x:r) a.pb({x,0});
for(auto x:b) a.pb({x,1});
sort(all(a));
n = a.size();
int last = 0,cmp = 0;
FOR(i,1,n){
if(a[i].S != a[last].S){
range[cmp] = {last,i-1};
last = i;
cmp++;
}
comp[i] = cmp;
}
range[cmp] = {last,n-1};
pref[0] = 0;
FOR(i,1,n){
if(comp[i] == comp[i-1]){
pref[i] = pref[i-1]+(a[i].F-a[range[comp[i]].F].F);
}
}
suff[n-1] = 0;
for(int i = n-2; i >= 0; i--){
if(comp[i] == comp[i+1]){
suff[i] = suff[i+1]+(a[range[comp[i]].S].F-a[i].F);
}
}
REP(i,n){
if(!comp[i]){
dp[i] = INF;
continue;
}
int st = range[comp[i]].F;
int lft = range[comp[st-1]].F,rgt = range[comp[st-1]].S;
int diff = a[st].F-a[rgt].F;
dp[i] = INF;
FOR(j,lft,rgt+1){
if(comp[j]+1 != comp[i]) continue;
dp[i] = min(dp[i],pref[i]+suff[j]+diff*max(st-j,i-st+1)+(j?dp[j-1]:0));
}
// cout << i << " " << pref[i] << " " << suff[i] << " " << dp[i] << endl;
}
return dp[n-1];
}
