#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
// #define int long long
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7 ;
const int N = 10000010 ;
ll dp[200010] , d[200010] , sum[200010];
ll min_total_length(vector<int> r, vector<int> b) {
vector<pair<ll,ll>> v;
for(auto i : r) v.push_back({i , 0});
for(auto i : b) v.push_back({i , 1});
sort(v.begin(), v.end());
int n = v.size();
sum[0] = v[0].first ;
d[0] = -1 ;
int k = 1 ;
while(v[k].second == v[k - 1].second) k++;
for(int i = 0 ; i < k ; ++i)dp[i] = dp[i - 1] + v[k].first - v[i].first;
dp[k] = dp[k - 1];
for(int i = 1 ; i < n; ++i){
if(!dp[i]) dp[i] = ooo;
sum[i] = sum[i - 1] + v[i].first;
d[i] = (v[i].second == v[i - 1].second ? d[i - 1] : i - 1);
if(d[i] == -1) continue ;
dp[i] = min(dp[i - 1] + v[i].first - v[d[i]].first , dp[i]);
if(d[d[i]] <= d[i] - (i - d[i]) ){
dp[i] = min(dp[i] ,
(sum[i] - sum[d[i]]) - (sum[d[i]] - sum[d[i] - (i - d[i])]) + dp[d[i] - (i - d[i])]);
}
}
return dp[n - 1];
}
