#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = 1e18;
long long min_total_length(vector<int> R, vector<int> B) {
ll N = R.size(), M = B.size();
vector <pair<ll, ll>> polls(1);
for (int i = 0; i < N; i++) {
polls.push_back({R[i], 0});
}
for (int i = 0; i < M; i++) {
polls.push_back({B[i], 1});
}
sort(polls.begin(), polls.end());
ll K = N+M;
vector <ll> dp(K+5, INF);
dp[0] = 0;
auto Matching = [&](ll l, ll r) {
ll ptr = 0, len = 0;
ll ret = 0;
for (int j = l; j <= r; j++) {
ret += (polls[j].second == polls[l].second ? -1 : 1)*polls[j].first;
}
for (int j = l; j < r; j++) {
len++;
if (polls[j].second != polls[j+1].second) {
ptr = j;
break;
}
}
ll lf = len, rg = (r-l+1)-len;
if (lf < rg) ret -= polls[ptr].first*(rg-lf);
else ret += polls[ptr+1].first*(lf-rg);
return ret;
};
for (int i = 1; i <= K; i++) {
bool z = 0;
ll sum = polls[i].first;
for (int j = i; j >= 1; --j) {
sum += polls[j].first;
if (polls[i].second == polls[j].second) {
if (z) break;
for (int k = j-1; k >= 1; --k) {
if (polls[k].second != polls[i].second) {
dp[i] = min(dp[i], dp[j-1]+sum-(i-j+1)*polls[k].first);
break;
}
}
}
else {
z = 1;
dp[i] = min(dp[i], dp[j-1]+Matching(j, i));
}
}
}
return dp[K];
}
