#include <bits/stdc++.h>
#pragma GCC optimize("-Ofast")
using namespace std;
long long power(long long x, long long y, long long m) {
  long long temp;
  if (y == 0) return 1;
  temp = (power(x, y / 2, m)) % m;
  if (y % 2 == 0)
    return ((temp % m) * temp);
  else
    return ((x * temp % m) * temp % m) % m;
}
long long inv(long long x) {
  return (power(x, 1000000007 - 2, 1000000007)) % 1000000007;
}
bool comp(long long a, long long b) { return a > b; }
map<long long, long long> path;
long long finder(long long n) {
  if (n + 1 != (path.upper_bound(n)->first)) {
    return (n + 1);
  } else
    return (path.at(n) = finder(path.at(n)));
}
int32_t main() {
  iostream::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, counter = 0;
  cin >> n;
  long long arr[n], arr2[n];
  vector<pair<long long, long long>> lolz;
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (long long i = 0; i < n; i++) {
    cin >> arr2[i];
  }
  for (long long i = 0; i < n; i++) {
    lolz.push_back({-arr2[i], arr[i]});
  }
  sort(lolz.begin(), lolz.end());
  for (long long i = 0; i < n; i++) {
    if (path.find(lolz[i].second) == path.end()) {
      path.insert({lolz[i].second, lolz[i].second + 1});
    } else {
      long long result = finder(lolz[i].second);
      counter += (-lolz[i].second + result) * (-lolz[i].first);
      path.insert({result, result + 1});
    }
  }
  cout << counter;
  return 0;
}
