#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "wiring.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll min_total_length(std::vector<int> a, std::vector<int> b)
{
ll ans = 0, n = a.size(), m = b.size();
pp(ll, ll) c[n + m + 1];
a.ins(a.begin(), 0);
b.ins(b.begin(), 0);
for (ll i = 1; i <= n; i++)
c[i] = mpr(a[i], 0);
for (ll i = 1; i <= m; i++)
c[i + n] = mpr(b[i], 1);
sort(all(c));
ll dp[n + m + 1], mndist[n + m + 1], last[2] = {-1, -1};
for (ll i = 1; i <= n + m; i++)
{
if (last[!c[i].S] == -1)
mndist[i] = 1e18;
else
mndist[i] = c[i].F - c[last[!c[i].S]].F;
last[c[i].S] = i;
}
dp[0] = 0;
dp[1] = 1e18;
for (ll i = 2; i <= n + m; i++)
{
dp[i] = 1e18;
last[0] = last[1] = -1;
last[c[i].S] = i;
ll sum = 0;
for (ll j = i - 1; j >= 1; j--)
{
if (c[i].S != c[j].S)
dp[i] = min(dp[i], sum + min(dp[j], dp[j - 1]) + c[i].F - c[j].F);
else
sum += min(mndist[j], (last[!c[j].S] != -1 ? c[last[!c[j].S]].F - c[j].F : (ll)1e18));
last[c[i].S] = i;
}
}
// for (ll i = 1; i <= n + m; i++)
// cout << mndist[i] << " \n"[i == n + m];
return dp[n + m];
}
