#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("avx,avx2,fma")
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  a = a % 998244353;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 998244353;
    }
    a = (a * a) % 998244353;
    b >>= 1;
  }
  return res;
}
long long fermat_inv(long long y) { return power(y, 998244353 - 2); }
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) {
      res = (res * a);
    }
    a = (a * a);
    b >>= 1LL;
  }
  return res;
}
const long long dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
const long long dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
void solve() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  set<long long> s;
  map<long long, vector<long long> > m;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    s.insert(v[i]);
  }
  for (long long i = 0; i < n; i++) {
    long long t;
    cin >> t;
    m[v[i]].push_back(t);
  }
  long long c = 0, ans = 0;
  priority_queue<long long> q;
  for (auto x : s) {
    for (auto y : m[x]) {
      c += y;
      q.push(y);
    }
    c -= (q.top());
    ans += c;
    q.pop();
    if (!q.empty()) s.insert(x + 1);
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
