#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const double PI = acos(-1.0);
struct node {
  long long t, v;
} arr[maxn];
bool cmp(node a, node b) {
  if (a.t == b.t)
    return a.v < b.v;
  else
    return a.t > b.t;
}
map<long long, long long> pp;
long long seek(long long pos) {
  if (pp[pos] == 0)
    return pos;
  else
    return pp[pos] = seek(pp[pos]);
}
void mix(long long son, long long fa) {
  son = seek(son);
  fa = seek(fa);
  pp[son] = fa;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  long long n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i].v;
  }
  for (int i = 1; i <= n; i++) {
    cin >> arr[i].t;
  }
  sort(arr + 1, arr + n + 1, cmp);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    long long pos = seek(arr[i].v);
    ans += (pos - arr[i].v) * arr[i].t;
    mix(pos, pos + 1);
  }
  cout << ans << '\n';
  return 0;
}
