#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int n,x,y,ans;
struct node{
	int xf,py;
	int c;
}a[1000005];
bool cmp(node a,node b){
	return a.c>=b.c;
} 
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].xf;
	}
	for(int i=1;i<=n;i++){
		cin>>a[i].py;
		a[i].c=a[i].xf-a[i].py;
		if(a[i].xf>a[i].py)x++;
		else if(a[i].xf<a[i].py)y++;
		else x++,y++;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		if(a[i].c>0)continue;
		if(x==y){
			if(a[i].c==0)ans+=abs(a[i].c)+1,x++;
			else ans+=abs(a[i].c),x++; 
		}
		if(x>y)break;
		if(a[i].c==0)ans+=abs(a[i].c)+1,x++;
		else ans+=abs(a[i].c)+1,x++,y--; 
	}	
	cout<<ans<<endl;
	return 0;
}

第3~7UKE,初步诊断没有RE(bushi