#include <bits/stdc++.h>
using namespace std;
long long n, h, l, r;
long long fun(long long i, long long t, vector<long long> &a,
              vector<vector<long long>> &dp) {
  if (i >= n) return 0;
  t %= h;
  if (dp[i][t] != -1) return dp[i][t];
  long long m = (t >= l and t <= r);
  m +=
      max(fun(i + 1, t + a[i + 1], a, dp), fun(i + 1, t + a[i + 1] - 1, a, dp));
  return dp[i][t] = m;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  vector<pair<long long, long long>> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = 0;
  }
  for (long long i = 0; i < n; i++) cin >> a[i].second;
  sort(a.begin(), a.end());
  long long ans = 0;
  multiset<long long> ms;
  long long i = 0, c = 0, s = 0;
  while (i < n) {
    if (ms.empty()) c = a[i].first;
    while (i < n and a[i].first == c) {
      ms.insert(a[i].second);
      s += a[i].second;
      i++;
    }
    while (ms.size()) {
      if (i < n and a[i].first == c) break;
      auto it = ms.end();
      it--;
      s -= *it;
      ans += s;
      ms.erase(it);
      c++;
    }
  }
  cout << ans << '\n';
  return 0;
}
