#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
const long long N = 100011;
void solve() {
  long long n, ans = 0;
  cin >> n;
  pair<long long, long long> a[n + 17];
  multiset<long long> s;
  for (long long i = 1; i <= n; i++) cin >> a[i].first;
  for (long long i = 1; i <= n; i++) cin >> a[i].second;
  sort(a + 1, a + n + 1);
  long long sum = 0;
  long long mn = 0;
  a[n + 1].first = -1;
  for (long long ind = 1; ind <= n; ind++) {
    mn += 1;
    if (s.empty()) mn = a[ind].first;
    long long j = ind;
    while (a[j].first == mn) {
      s.insert(a[j].second);
      sum += a[j].second;
      j += 1;
    }
    long long mx = *(--s.end());
    sum -= mx;
    s.erase(s.find(mx));
    ans += sum;
    ind = j - 1;
  }
  while (s.size()) {
    int mx = *(--s.end());
    sum -= mx;
    s.erase(s.find(mx));
    ans += sum;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
    cout << endl;
  }
}
