#include <bits/stdc++.h>
using namespace std;
int n,m,t[10086],q[10086],fa,fb,la,lb,ans=0;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	cin>>n;
	for (int i=0;i<n;i++){
		cin>>t[i];
	}
	for (int i=0;i<n;i++){
		cin>>q[i];
	}
	sort (t,t+n,cmp);
	sort (q,q+n,cmp);
	fa=0;
	fb=0;
	la=n-1;
	lb=n-1;
	for (int i=0;i<n;i++){
		if (fa>la)break;
		if (t[fa]>q[fb]){
			ans+=200;
			fa++;
			fb++;
		}
		if (t[fa]<q[fb]){
			ans-=200;
			la--;
			fb++;
		}
		if (t[fa]==q[fb]){
			if (t[la]>q[lb]){
				ans+=200;
				la--;
				lb--;
			}
			else{
				ans-=200;
				la--;
				fb++;
			}
		}
	}
	cout<<ans;
}

贪心