#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
void solve() {
  long long n;
  cin >> n;
  long long a[n + 1], t[n + 1];
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<pair<long long, long long> > v;
  for (long long i = 1; i <= n; i++) {
    cin >> t[i];
    v.push_back({a[i], -t[i]});
  }
  sort(v.begin(), v.end());
  priority_queue<long long> q;
  for (long long i = 0; i < n; i++) {
    v[i].second *= -1;
  }
  long long sum = 0, ans = 0, d = 200005;
  for (long long i = 1; i < n; i++) {
    if (v[i].first == v[i - 1].first) {
      long long temp = v[i].second;
      q.push(temp);
      ans += temp;
      sum += temp;
    } else {
      if (v[i].first > v[i - 1].first) {
        long long diff = v[i].first - v[i - 1].first;
        diff -= 1;
        while (diff && q.size()) {
          long long temp = q.top();
          q.pop();
          sum -= temp;
          ans += sum;
          diff--;
        }
        q.push(v[i].second);
        sum += v[i].second;
        diff = 1;
        while (diff && q.size()) {
          long long temp = q.top();
          q.pop();
          sum -= temp;
          ans += sum;
          diff--;
        }
      }
    }
  }
  while (d && q.size()) {
    long long temp = q.top();
    q.pop();
    sum -= temp;
    ans += sum;
    d--;
  }
  cout << ans << endl;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
