#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 1e5;
vector<long long int> v[N];
long long int path = 0;
long long int dest = 0;
vector<long long int> beta[N + 1];
double prob[N + 1];
double dis[N + 1];
vector<long long int> baap[N + 1];
long long int solve() {
  long long int n;
  cin >> n;
  long long int a[n + 1];
  long long int p[n + 1];
  unordered_map<long long int, priority_queue<long long int> > pri;
  vector<pair<long long int, long long int> > vc;
  for (long long int i = 1; i <= n; i++) cin >> a[i];
  for (long long int j = 1; j <= n; j++) {
    cin >> p[j];
    vc.push_back(make_pair(a[j], p[j]));
  }
  sort(vc.begin(), vc.end());
  priority_queue<long long int> q;
  long long int res = 0;
  long long int sum = 0;
  for (long long int i = 0; i < vc.size(); i++) {
    long long int num = vc[i].first;
    long long int val = vc[i].second;
    if (i == 0) {
      q.push(val);
      sum += val;
    } else {
      long long int diff = vc[i].first - vc[i - 1].first;
      for (long long int j = 1; j <= diff; j++) {
        if (q.empty()) break;
        sum = sum - q.top();
        res = res + sum;
        q.pop();
      }
      q.push(val);
      sum += val;
    }
  }
  while (q.size()) {
    sum = sum - q.top();
    q.pop();
    res += sum;
  }
  cout << res << endl;
  return 0;
}
int32_t main() {
  ios_base::sync_with_stdio(cin.tie(NULL));
  cout.tie(NULL);
  long long int tc = 1;
  while (tc--) {
    solve();
  }
}
