#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > a(n);
  for (auto &x : a) cin >> x.first;
  for (auto &x : a) cin >> x.second;
  long long ans = 0;
  sort(a.begin(), a.end());
  priority_queue<long long> pq;
  long long sum = 0;
  for (long long i = 0; i < n; ++i) {
    if (!pq.empty()) {
      long long dif = a[i].first - a[i - 1].first - 1;
      long long j = 0;
      while (!pq.empty()) {
        if (j >= dif) break;
        long long top = pq.top();
        pq.pop();
        ans += top * j;
        sum -= top;
        ++j;
      }
      assert(sum >= 0);
      ans += sum * dif;
    }
    long long j = i;
    while (j < n and a[i].first == a[j].first) {
      pq.push(a[j].second);
      sum += a[j].second;
      ++j;
    }
    long long top = pq.top();
    pq.pop();
    sum -= top;
    assert(sum >= 0);
    ans += sum;
    i = j - 1;
  }
  long long j = 0;
  while (!pq.empty()) {
    ans += pq.top() * j;
    ++j;
    pq.pop();
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = 0; i < t; ++i) {
    solve();
  }
  return 0;
}
