#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 1e5 + 10;
typedef long long LL;
int n;
LL b[N], c[N];
struct Node{
  int cha;
  int id;
} d[N];
int cmp(Node a,Node b){
  return a.cha < b.cha;
}
int ans = 0;
int main() {
  cin >> n;
  for (int i = 1; i <= 2 * n; i++)
    cin >> b[i];
  for (int i = 1; i <= 2 * n; i++)
    cin >> c[i];
  for (int i = 1; i <= 2 * n; i++)
    d[i].cha = c[i] - b[i],d[i].id = i;
  sort(d+1,d+1+2*n,cmp);
  for (int i = n+1; i <= 2 * n;i++){
      ans += c[d[i].id];
  }
  for (int i = 1; i <= n;i++){
    ans += b[d[i].id];
  }
  cout << ans << endl;
  return 0;
}