#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n), t(n);
  for (auto &i : a) cin >> i;
  for (auto &i : t) cin >> i;
  map<long long, vector<long long> > mp;
  for (long long i = (0); i < (n); i++) mp[a[i]].push_back(t[i]);
  vector<long long> vals;
  for (auto &i : mp) vals.push_back(i.first);
  multiset<long long> ms;
  long long sum = 0;
  long long ans = 0;
  long long curr = vals[0];
  long long ind = 1;
  while (true) {
    vector<long long> x = mp[curr];
    for (auto &i : x) {
      ms.insert(i);
      sum += i;
    }
    assert(ms.size() > 0);
    sum -= *ms.rbegin();
    ans += sum;
    ms.erase(ms.lower_bound(*ms.rbegin()));
    curr++;
    if (ms.size() == 0) {
      auto loc = lower_bound(vals.begin(), vals.end(), curr);
      if (loc == vals.end()) break;
      long long index = loc - vals.begin();
      curr = vals[index];
      ind++;
    }
  }
  cout << ans << '\n';
}
signed main() {
  cin.tie(NULL), ios_base::sync_with_stdio(false), cout.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
