#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 1e5+5;
const ll inf = 1e18;
set<pii> pairs;
map<ll, ll> dp;
int n;
int _abs(int v) {
return v < 0 ? -v : v;
}
ll hsh(int i, int j, bool lmatch, bool rmatch) {
return (ll) 4*i*n+4*j+2*lmatch+rmatch;
}
ll make_dp(int i, int j, bool lmatch, bool rmatch, vector<int> &r, vector<int> &b) {
int cost = _abs(r[i]-b[j]);
if (i == r.size()-1 && j == b.size()-1) {
return cost;
}
ll cur_hsh = hsh(i, j, lmatch, rmatch);
if (dp.find(cur_hsh) != dp.end()) return dp[cur_hsh];
ll ans = inf;
if (pairs.find(pii(i+1, j)) != pairs.end()) {
if (lmatch) ans = min(ans, make_dp(i+1, j, 0, rmatch, r, b));
ans = min(ans, make_dp(i+1, j, 0, 1, r, b)+cost);
}
if (pairs.find(pii(i, j+1)) != pairs.end()) {
if (rmatch) ans = min(ans, make_dp(i, j+1, lmatch, 0, r, b));;
ans = min(ans, make_dp(i, j+1, 1, 0, r, b)+cost);
}
dp[cur_hsh] = ans;
// cerr << i << ' ' << j << ' ' << lmatch << ' ' << rmatch << ' ' << ans << '\n';
return ans;
}
ll min_total_length(vector<int> r, vector<int> b) {
n = r.size()+b.size();
int i = 0;
for (int j = 0; j < b.size(); j++) {
while (i < r.size() && r[i] < b[j]) i++;
if (i < r.size()) pairs.insert(pii(i, j));
if (i) pairs.insert(pii(i-1, j));
}
int j = 0;
for (int i = 0; i < r.size(); i++) {
while (j < b.size() && b[j] < r[i]) j++;
if (j < b.size()) pairs.insert(pii(i, j));
if (j) pairs.insert(pii(i, j-1));
}
return make_dp(0, 0, 0, 0, r, b);
}
