#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:268435456")
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2>& p) {
  out << p.first << " " << p.second;
  return out;
}
template <typename T>
istream& operator>>(istream& in, vector<T>& v) {
  for (int i = 0; i < int(v.size()); ++i) {
    in >> v[i];
  }
  return in;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (int i = 0; i < int(v.size()); ++i) {
    out << v[i] << ' ';
  }
  return out;
}
vector<int> a, t;
bool cmp(int a, int b) { return t[a] < t[b]; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  a.resize(n);
  t.resize(n);
  cin >> a >> t;
  map<int, vector<int> > was;
  for (int i = 0; i < int(n); ++i) was[a[i]].push_back(i);
  long long res = 0;
  multiset<int> up;
  long long sum = 0;
  for (auto it = (was).begin(); it != (was).end(); ++it) {
    sort((it->second).begin(), (it->second).end(), cmp);
    if (!up.empty() && it->second.front() == -1) {
      sum -= *(--up.end());
      up.erase(--up.end());
    } else if (!up.empty() && t[it->second.back()] < *(--up.end())) {
      sum -= *(--up.end());
      up.erase(--up.end());
      for (int i = 0; i < int(it->second.size()); ++i) {
        up.insert(t[it->second[i]]);
        sum += t[it->second[i]];
      }
    } else {
      for (int i = 0; i < int(it->second.size() - 1); ++i) {
        up.insert(t[it->second[i]]);
        sum += t[it->second[i]];
      }
    }
    res += sum;
    auto it1 = it;
    ++it1;
    if (!up.empty() && (it1 == was.end() || it1->first - it->first > 1))
      was[it->first + 1].push_back(-1);
  }
  cout << res << endl;
  return 0;
}
