#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define ll long long int
#define all(x) x.begin(),x.end()
const int N = 250;
ll dp[N][N];
long long min_total_length(std::vector<int> R, std::vector<int> B) {
vector<ll> r(all(R));
vector<ll> b(all(B));
int n = r.size();
int m = b.size();
vector<ll> C(n);
vector<ll> D(m);
for(int i = 0; i < n; ++i){
int pos = lower_bound(all(b), r[i]) - b.begin();
if(pos == m) --pos;
ll mn = abs(b[pos] - r[i]);
if(pos>0) mn = min(mn, abs(b[pos-1] - r[i]));
C[i] = mn;
}
swap(n, m);
swap(C, D);
swap(r, b);
for(int i = 0; i < n; ++i){
int pos = lower_bound(all(b), r[i]) - b.begin();
if(pos == m) --pos;
ll mn = abs(b[pos] - r[i]);
if(pos>0) mn = min(mn, abs(b[pos-1] - r[i]));
C[i] = mn;
}
swap(n, m);
swap(C, D);
swap(r, b);
reverse(all(r));
reverse(all(C));
ll ans = 0;
for(ll x: C) ans += x;
for(ll x: D) ans += x;
ans -= C[0];
ll cur_sum = ans;
for(int i = 0; i < min(n, m); ++i){
ll nxt = abs(r[i] - b[i]);
cur_sum -= C[i];
cur_sum -= D[i];
cur_sum += nxt;
ans = min(ans, cur_sum);
}
return ans;
}
