#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e18
#define pb push_back
#define fi first
#define se second
#define sz size()
//===================//
// begin program //
//===================//
const int MX = 5e5;
vii all;
bitset<MX> connected;
int n, m, N;
ll nxtC[MX];
ll dp[MX];
int gd(int i, int j) {
return abs(all[i].fi - all[j].fi);
}
ll getCost(int x, int y) {
ll ans = 0;
int R=0, B=0;
REI(i,x,y) {
if(all[i].se == all[x].se) {
if(i != x && all[i-1].se != all[x].se) {
return INF;
}
R++;
} else {
B++;
}
}
if(B == 0) return INF;
if(R < B) {
RE(i,R) ans += gd(x+i, x+R-1);
RE(i,B) ans += gd(y-i, x+R-1);
} else {
RE(i,R) ans += gd(x+i, y-B+1);
RE(i,B) ans += gd(y-i, y-B+1);
}
return ans;
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
n = r.sz, m = b.sz;
N = n+m;
{
int i=0, j=0;
while(i != n || j != m) {
if(j == m || (i != n && r[i] < b[j])) {
all.pb({r[i++], 0});
} else {
all.pb({b[j++], 1});
}
}
}
// subtask 2
if(getCost(0,N-1) != INF)
return getCost(0,N-1);
dp[0] = 0;
int beg = -1, nxtBeg=-1, last=-1;
REP(i,1,N+1) {
if(all[i-1].se != last) {
last = all[i-1].se;
beg = nxtBeg;
nxtBeg = i-1;
}
dp[i] = INF;
ll mn = INF;
ll lst = INF;
REV(j,beg,i) {
mn = min(mn, dp[j]);
ll cst = getCost(j,i-1);
dp[i] = min(dp[i], mn+cst);
}
}
return dp[N];
}
