#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 200005;
int a,b;
deque<int> DQ[MAXN];
int L[MAXN], R[MAXN];
int M[MAXN];
int T[MAXN];
vector<pi> vec;
int ans;
long long min_total_length(std::vector<int32_t> RR, std::vector<int32_t> BB){
a=RR.size();
b=BB.size();
FOR(i,0,a-1){
vec.pb({RR[i],0});
}
FOR(i,0,b-1) {
vec.pb({BB[i],1});
}
sort(all(vec)); // {x position, 0/1}
int s=vec.size();
int dlen=0;
T[0]=-1;
FOR(i,0,s-1) {
if(T[dlen] != vec[i].s) {
++dlen;
T[dlen]=vec[i].s;
}
DQ[dlen].pb(vec[i].f); // all the positions of this segment
}
FOR(i,1,dlen) {
int lf=DQ[i].front();
int rg=DQ[i].back();
for(auto x:DQ[i]) {
int lfdist=oo;
if(i!=1)lfdist=x-DQ[i-1].back();
int rgdist=oo;
if(i!=dlen)rgdist=DQ[i+1].front()-x;
if(lfdist==rgdist) { // centre node. don't know where to go yet
M[i]=1;
if(i!=1)ans+=x-DQ[i-1].back();
else ans+=DQ[i+1].front()-x;
} else if(lfdist<rgdist) { // go left
ans+=x-DQ[i-1].back();
++L[i];
} else { // go right
ans+=DQ[i+1].front()-x;
++R[i];
}
}
if(min(L[i],R[i-1]) != 0)ans -= min(L[i], R[i-1]) * (DQ[i].front()-DQ[i-1].back()); // these can just be paired up
if(R[i-1]>=L[i]) {
R[i-1]-=L[i];
L[i]=0;
} else {
L[i]-=R[i-1];
R[i-1]=0;
}
db(i);
db3(M[i],L[i],R[i]);
}
db(ans);
FOR(i,1,dlen) {
if(M[i]) {
if(R[i-1]>0) {
reach
--M[i];
--R[i-1];
ans-=DQ[i].front()-DQ[i-1].back();
continue;
}
if(L[i+1]>0) {
reach
--M[i];
--L[i+1];
ans-=DQ[i+1].front()-DQ[i].back();
continue;
}
if(M[i+1]>0) {
--M[i];
--M[i+1];
ans-=DQ[i+1].front()-DQ[i].back();
continue;
}
}
}
return ans;
}
