#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n;
vector<pair<int, int>> a;
multiset<int> q;
long long ans = 0;
long long sum = 0;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  scanf("%d", &n);
  a.resize(n);
  int x;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    a[i].first = x;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    a[i].second = x;
  }
  sort(a.begin(), a.end());
  int cur, prev = -1;
  for (int i = 0; i < n; ++i) {
    cur = a[i].first;
    while (q.size() && (cur - prev++)) {
      sum -= *(--q.end());
      q.erase(--q.end());
      ans += sum;
    }
    sum += (long long)a[i].second;
    ;
    q.insert(a[i].second);
    prev = cur;
  }
  while (q.size() > 1) {
    sum -= *(--q.end());
    q.erase(--q.end());
    ans += sum;
  }
  cout << ans << endl;
  return 0;
}
