//나는 가상 소녀들에게 큰 호감이 있습니다.
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <cassert>
#include <fstream>
#include <stdarg.h>
#include <utility>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 2e18
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"
template<typename A, typename B, typename C>
struct triple {
A X;
B Y;
C Z;
triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
if (a.X != b.X)
return a.X < b.X;
if (a.Y != b.Y)
return a.Y < b.Y;
return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
ofs << "( " << p.F << " , " << p.S << " )";
return ofs;
}
template<typename T>
void print(T a) {
for (auto i : a)
cout << i << ' ';
cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
return *max_element(all(a));
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
long long min_total_length(std::vector<int> R, std::vector<int> B) {
vector<pii> a, r, b;
a.push_back({ 0,0 });
for (auto x : R) a.push_back({ x, 0 }), r.push_back({ x, 0 });
for (auto x : B) a.push_back({ x, 1 }), b.push_back({ x, 1 });
SORT(a);
int n = sz(a) - 1;
vector<ll> dp(n + 1), p(n + 1);
map<int, int> m; m[0] = 0;
int cnt = 0;
auto get = [&](pii x) {
ll res = inf;
if (x.second) {
auto it = lower_bound(all(r), x);
if (it != r.end())res = (*it).first - x.first;
if (it != r.begin()) { it--; res = min(res, (ll)x.first - (*it).first); }
}
else {
auto it = lower_bound(all(b), x);
if (it != b.end())res = (*it).first - x.first;
if (it != b.begin()) { it--; res = min(res, (ll)x.first - (*it).first); }
}
return res;
};
for (int i = 1; i <= n; i++) {
p[i] = p[i - 1] + ((a[i].second) ? -a[i].first : a[i].first);
cnt += a[i].second ? -1 : 1;
dp[i] = dp[i - 1] + get(a[i]);
if (!cnt || m[cnt] > 0) dp[i] = min(dp[i], dp[m[cnt]] + abs(p[i] - p[m[cnt]]));
m[cnt] = i;
}
return dp[n];
}
