#include<bits/stdc++.h>
using namespace std;
const int N=100010;
long long a[N],b[N];
int n;
long long ans;
priority_queue <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]);
	if(a[n]<b[n])
	{
		ans+=b[n]-a[n];
    	q.push(a[n]);
	}
	else q.push(b[n]);
	for(int i=n-1;i>=1;i--)
	{
		if(a[i]<b[i]&&b[i]>=q.top()) ans+=b[i]-a[i],q.push(a[i]);
		else if(q.top()>a[i])
		{
			ans+=q.top()-a[i];
			q.pop();
			q.push(b[i]);
			q.push(a[i]);
		}
		else q.push(b[i]);
	}
	printf("%lld",ans);
	return 0;
}