#include <bits/stdc++.h>
using namespace std;

const int N = 100010;

long long a[N],b[N];
long long n,res;

priority_queue <long long,vector<long long>,greater<long long>> q; 

int main(){
    freopen("buy.in","r",stdin);
    freopen("buy.out","w",stdout);
    scanf("%lld",&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 x=q.top();
        q.pop();
        if(b[i]>x){
            res+=b[i]-x;
            x=b[i];
            q.push(x);
        }else{
            q.push(x);
        }
    }
    printf("%lld",res);
    return 0;
}