#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 5;
struct Node {
  int x, y;
};
Node a[200005];
int n;
bool cmp(Node x, Node y) { return x.x < y.x; }
signed main() {
  std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].x;
  for (int i = 1; i <= n; i++) cin >> a[i].y;
  sort(a + 1, a + n + 1, cmp);
  priority_queue<int> q;
  long long ind = 0, cnt = 0, ans = 0, tmp = 0;
  while (!q.empty() || ind < n) {
    cnt++;
    if (q.empty()) {
      cnt = a[ind + 1].x;
      while (cnt == a[ind + 1].x && ind < n) {
        ind++;
        tmp += a[ind].y;
        q.push(a[ind].y);
      }
    } else {
      while (cnt == a[ind + 1].x && ind < n) {
        ind++;
        tmp += a[ind].y;
        q.push(a[ind].y);
      }
    }
    tmp -= q.top();
    q.pop();
    ans += tmp;
  }
  cout << ans << endl;
  return 0;
}
