#include "wiring.h"
#include <algorithm>
#include <stdio.h>
#include <vector>
namespace
{
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.

ullt solve(std::vector<std::pair<uint,uint> >P)
{
    std::vector<ullt>A(P.size()+1,1e18);A[0]=0;
    for(uint p=0,l=0,r=0;p<P.size();l=r,r=p)
    {
        while(p<P.size()&&P[p].second==P[r].second)p++;
        for(uint i=l;i<r;i++)_min(A[i+1],A[i]+P[r].first-P[i].first);
        ullt s=0;
        for(uint j=0;j<p-r&&j<r-l;j++)
            s+=P[r+j].first-P[r-j-1].first,_min(A[r+j+1],A[r-j-1]+s);
        if(r)for(uint i=r;i<p;i++)_min(A[i+1],A[i]+P[i].first-P[r-1].first);
    }
    return A.back();
}

}

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
    std::vector<std::pair<uint,uint> >V;
    for(auto s:r)V.push_back({s,0});
    for(auto s:b)V.push_back({s,1});
    std::sort(V.begin(),V.end());
    return solve(V);
}