/*
ID: varunra2
LANG: C++
TASK: wiring
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define int long long
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e12
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
ll min_total_length(vector<int32_t> r, vector<int32_t> b) {
VII vals;
trav(x, r) vals.PB(MP(x, 0));
trav(x, b) vals.PB(MP(x, 1));
sort(all(vals));
vals.insert(vals.begin(), MP(-INF, vals[0].y ^ 1));
VI pref(sz(vals), 0);
int n = sz(pref);
for (int i = 1; i < n; i++) {
pref[i] = vals[i].x;
}
partial_sum(all(pref), pref.begin());
VI dp(n, INF);
dp[0] = 0;
int lft = 1, rt = 1;
for (int i = 1; i < n; i++) {
while (rt < n - 1 and vals[rt + 1].y == vals[i].y) rt++;
for (int j = lft; j < i; j++) {
dp[j] = min(dp[j], dp[j - 1] + vals[i].x - vals[j].x);
}
int val = dp[i - 1];
int preff = 0;
for (int j = i; j <= rt; j++) {
int cnt = j - i + 1;
preff += vals[j].x - vals[i - 1].x;
if (cnt <= i - lft)
val = min(val, dp[max(0ll, i - cnt - 1)] + cnt * vals[i - 1].x -
pref[i - 1] + pref[max(0ll, i - cnt - 1)]);
dp[j] = preff + val;
}
lft = i;
i = rt;
}
return dp.back();
}
// int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("wiring.in", "r", stdin);
// freopen("wiring.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0);
// cin.tie(0);
// int n, m;
// cin >> n >> m;
// vector<int32_t> r(n), b(m);
// trav(x, r) cin >> x;
// trav(x, b) cin >> x;
// cout << min_total_length(r, b) << '\n';
// return 0;
// }
