#include <bits/stdc++.h>
using namespace std;
const int maxd = 1e6 + 10;
int d[maxd], v[maxd], ls[maxd], rs[maxd], fa[maxd];
int n, m;
struct node {
  int x, y;
} a[maxd];
bool cmp(const node a, const node b) { return a.x < b.x; }
priority_queue<int> que;
int main() {
  scanf("%d", &n);
  d[0] = -1;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i].x);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i].y);
  sort(a + 1, a + 1 + n, cmp);
  long long ans = 0, res = 0;
  int now = 0, pos = 0, sz = 0;
  a[n + 1].x = 2e9;
  for (int i = 1; i <= n + 1; i++) {
    while (que.size() && a[i].x != now) {
      res -= que.top();
      que.pop();
      now++;
      ans += res;
    }
    if (que.size()) {
      que.push(a[i].y);
      res += a[i].y;
    } else {
      que.push(a[i].y);
      now = a[i].x;
      res = a[i].y;
    }
  }
  printf("%lld", ans);
  return 0;
}
