#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  vector<long long> a(n), t(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> t[i];
  }
  vector<pair<long long, long long> > at(n);
  for (int i = 0; i < n; i++) {
    at[i] = make_pair(a[i], t[i]);
  }
  sort(at.begin(), at.end());
  long long sum = 0, next = at[0].first, ans = 0;
  priority_queue<long long> pq;
  int i = 0;
  while (i < n) {
    while ((i < n) && (at[i].first == next)) {
      sum += at[i].second;
      pq.push(at[i].second);
      i++;
    }
    if (!pq.empty()) {
      ans += sum - pq.top();
      sum -= pq.top();
      pq.pop();
      next++;
    } else {
      next = at[i].first;
    }
  }
  while (!pq.empty()) {
    ans += sum - pq.top();
    sum -= pq.top();
    pq.pop();
  }
  cout << ans << "\n";
  return 0;
}
