#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 239;
const long long INFL = 2e18 + 239;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  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;
  }
  for (long long i = 0; i < n; ++i) {
    cin >> a[i].second;
  }
  sort(a.begin(), a.end());
  long long ans = 0;
  multiset<long long> bag;
  long long sum = 0;
  for (long long j = 0; j < n;) {
    long long i = j;
    bag.insert(a[i].second);
    sum += a[i].second;
    while (i + 1 < n && a[i].first == a[i + 1].first) {
      bag.insert(a[i + 1].second);
      sum += a[i + 1].second;
      ++i;
    }
    long long num = a[i].first;
    while (i + 1 == n || num < a[i + 1].first) {
      if (bag.size() <= 1) {
        bag.clear();
        sum = 0;
        break;
      }
      sum -= *bag.rbegin();
      ans += sum;
      bag.erase(--bag.end());
      ++num;
    }
    j = i + 1;
  }
  cout << ans;
  return 0;
}
