#include <bits/stdc++.h>
using namespace std;
long long modd = 1000 * 1000 * 1000 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cout.precision(17);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, 1000);
  int test_cases = 1;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    vector<long long> a, time_needed;
    for (int i = (0); i < (0) + (n); ++i) {
      int kk;
      cin >> kk;
      a.push_back(kk);
    }
    for (int i = (0); i < (0) + (n); ++i) {
      int kk;
      cin >> kk;
      time_needed.push_back(kk);
    }
    map<long long, multiset<long long>> freq;
    for (int i = (0); i < (0) + (n); ++i) {
      freq[a[i]].insert(time_needed[i]);
    }
    long long ret = 0;
    multiset<pair<long long, long long>> curr;
    long long val = freq.begin()->first;
    while (true) {
      for (auto x : freq[val]) {
        curr.insert(make_pair(x, val));
      }
      if (!curr.empty()) {
        ret += (val - prev(curr.end())->second) * prev(curr.end())->first;
        curr.erase(prev(curr.end()));
      }
      ++val;
      if (curr.empty() && (val <= prev(freq.end())->first)) {
        val = (freq.lower_bound(val))->first;
      }
      if ((val > prev(freq.end())->first) && (curr.empty())) {
        break;
      }
    }
    cout << ret << endl;
  }
  return 0;
}
