#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int _abs(int x) { return x < 0 ? -x : x; }
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = (long long)(ret) * (x) % MOD;
    x = (long long)(x) * (x) % MOD;
    y >>= 1;
  }
  return ret;
}
void checkmin(int &x, int y) {
  if (x > y) x = y;
}
void checkmax(int &x, int y) {
  if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
  if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
  if (x < y) x = y;
}
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 200005;
int n;
pair<int, int> a[N];
priority_queue<int> q;
long long ans = 0;
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i].first = read();
  for (int i = 1; i <= n; i++) a[i].second = read();
  sort(a + 1, a + n + 1);
  int now = a[1].first;
  q.push(a[1].second);
  long long sum = a[1].second;
  for (int i = 2; i <= n; i++) {
    while (!q.empty() && now < a[i].first) {
      int u = q.top();
      q.pop();
      ans += sum - u;
      now++;
      sum -= u;
    }
    q.push(a[i].second);
    sum += a[i].second;
    now = a[i].first;
  }
  while (!q.empty()) {
    int u = q.top();
    q.pop();
    ans += sum - u;
    sum -= u;
  }
  cout << ans << endl;
  return 0;
}
