#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;
const long long inf=1e15;
int n,m;
int red[MAXN],blue[MAXN];
unordered_map<long long,bool> li;
unordered_map<long long,long long> dp;
long long st(long long x,long long y){
return x*1000000+y;
}
long long ff(int l,int r){
if(abs(l-r)>20 and n+m>500)return inf;
if(l==n and r==m)return abs(red[l]-blue[r]);
if(li[st(l,r)])return dp[st(l,r)];
li[st(l,r)]=true;
dp[st(l,r)]=inf;
if(l<n)dp[st(l,r)]=min(dp[st(l,r)],ff(l+1,r));
if(r<m)dp[st(l,r)]=min(dp[st(l,r)],ff(l,r+1));
if(l<n and r<m)dp[st(l,r)]=min(dp[st(l,r)],ff(l+1,r+1));
dp[st(l,r)]+=abs(red[l]-blue[r]);
return dp[st(l,r)];
}
long long min_total_length(vector<int> R,vector<int> B){
n=int(R.size()); m=int(B.size());
for(int i=1;i<=n;i++)red[i]=R[i-1];
for(int i=1;i<=m;i++)blue[i]=B[i-1];
return ff(1,1);
}
/*
int main(){
cout<<min_total_length({1, 2, 3, 7}, {0, 4, 5, 9, 10})<<"\n";
}
*/
