#include<bits/stdc++.h>
using namespace std;
int n;
long long a[100010],b[100010],ans;
priority_queue<long long,vector<long long>,greater<long long> > q;
int main()
{
    freopen("buy.in","r",stdin);
    freopen("buy.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&b[i]);  
    }
    for(int i=1;i<=n;i++)
    {
        q.push(a[i]);
        long long mi=q.top();
        q.pop();
        if(mi<b[i])
        {
            ans+=b[i]-mi;
            q.push(b[i]);
        }
        else
        {
            q.push(mi);
        }
    }
    printf("%lld",ans);
    return 0;
}