#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 1e9
#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;
int gd(int i, int j) {
return abs(all[i].fi - all[j].fi);
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
ll ans = 0;
n = r.sz, m = b.sz;
N = n+m;
{
int i=0, j=0;
while(i != n && j != m) {
if(r[i] < b[j]) {
ans += b[j] - r[i];
i++; j++;
} else {
ans += r[i] - b[j];
i++; j++;
}
}
while(i != n) {
ans += abs(b[m-1] - r[i++]);
}
while(j != m) {
ans += abs(b[j++] - r[n-1]);
}
}
return ans;
}
