#include "wiring.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
ll min_total_length(vim r, vim b) {
int n=r.size(), m=b.size();
vector<ll> D(n+m+1), sr(n+m+1), sb(n+m+1);
vim lst(200010);
vector<pii> ar;
ar.push_back({0, 0});
for (int i:r) ar.push_back({i, 0});
for (int i:b) ar.push_back({i, 1});
sort(ar.begin(), ar.end());
fill(lst.begin(), lst.end(), -1);
for (int i=1; i<=n+m; i++) {
sr[i]=sr[i-1], sb[i]=sb[i-1];
if (ar[i].se==0) sr[i]+=ar[i].fi;
else sb[i]+=ar[i].fi;
}
int x=0, y[]={-1,-1};
y[ar[0].se]=ar[0].fi;
lst[100000]=0;
int l; for (l=1; ar[l].se==ar[1].se; l++) {
x+=(ar[l].se==0?1:-1);
lst[x+100000]=l;
y[ar[l].se]=ar[l].fi;
}
x+=(ar[l].se==0?1:-1);
lst[x+100000]=l;
y[ar[l].se]=ar[l].fi;
for (int i=1; i<=l; i++) D[i]=D[i-1]+ar[l].fi-ar[i].fi;
for (int i=l+1; i<=n+m; i++) {
x+=(ar[i].se==0?1:-1);
int ls=lst[x+100000];
D[i]=(1ll<<60);
if (ls!=-1) D[i]=D[ls]+abs((sr[i]-sr[ls])-(sb[i]-sb[ls]));
lst[x+100000]=i;
if (i) D[i]=min(D[i], D[i-1]+ar[i].fi-(y[1-ar[i].se]==-1?ar[i].fi:y[1-ar[i].se]));
y[ar[i].se]=ar[i].fi;
}
return D.back();
}
