#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 5;
class cmp {
 public:
  cmp() {}
  bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const {
    if (p1.first == p2.first)
      return p1.second > p2.second;
    else
      return (p1.first < p2.first);
  }
};
priority_queue<int> pq;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  vector<pair<int, int>> v(n + 2);
  map<int, int> mp;
  for (int i = 1; i <= n; i++) {
    cin >> v[i].first;
  }
  for (int i = 1; i <= n; i++) {
    cin >> v[i].second;
  }
  v[0] = make_pair(0, 0);
  v[n + 1] = make_pair(2e9 + 100, 0);
  sort(v.begin(), v.end(), cmp());
  long long temp = 0;
  long long ans = 0;
  for (int i = 1; i <= n + 1; i++) {
    int f = v[i].first - v[i - 1].first;
    while (f && !pq.empty()) {
      temp -= pq.top();
      ans += temp;
      pq.pop();
      f--;
    }
    pq.push(v[i].second);
    temp += v[i].second;
  }
  cout << ans << endl;
  return 0;
}
