#include<bits/stdc++.h>
using namespace std;
long long x, y, a[200005], b[200005], ans, n;
priority_queue <int> pq;
main(){
	cin>>n;
	for (int i=1; i<=n; i++)cin>>a[n-i+1],ans+=a[n-i+1];
	for (int i=1; i<=n; i++)cin>>b[i],ans+=b[i];
	for (int i=1; i<=n; i++){
		pq.push(-a[i]);
		pq.push(-b[i]);
		ans+=pq.top();
		pq.pop();
	}
	cout<<ans;
}
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll n;cin >> n;
  vl a(n),b(n);rep(i,n)cin >> a[i];rep(i,n)cin >> b[i];rev(all(a));
  priority_queue<ll,vl,greater<ll>> que;
  ll sum=accumulate(all(a),0LL)+accumulate(all(b),0LL);
  ll ans=0;
  rep(i,n){
    que.push(a[i]);que.push(b[i]);
    ans+=que.top();que.pop();
  }
  cout << sum-ans <<endl;
} 