#include <bits/stdc++.h>
using namespace std;
template <typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using max_pq = priority_queue<T>;
const int inf = 2e9 + 5;
const long long l_inf = 2e18 + 5;
const int mod_v = 1e9 + 7;
const int max_n = 1e5 + 5;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T>
T gcd(T a, T b) {
  while (b) {
    T temp = a % b;
    a = b;
    b = temp;
  }
  return a;
}
template <typename T>
tuple<T, T, T> egcd(T a, T b) {
  T x1 = 1, x2 = 0, y1 = 0, y2 = 1;
  while (b) {
    T q = a / b, r = a % b;
    T new_x = x1 - q * x2, new_y = y1 - q * y2;
    x1 = x2, y1 = y2, x2 = new_x, y2 = new_y;
    a = b, b = r;
  }
  return make_tuple(a, x1, y1);
}
inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
template <typename T>
inline T mod(T a, T b = mod_v) {
  return (a % b + b) % b;
}
template <typename T>
inline T mod_inv(T a, T b = mod_v) {
  return mod(get<1>(egcd(a, b)), b);
}
template <typename T>
inline T sum(T a, T b, T m = mod_v) {
  return mod(mod(a, m) + mod(b, m), m);
}
template <typename T>
inline T difference(T a, T b, T m = mod_v) {
  return mod(mod(a, m) - mod(b, m), m);
}
inline long long product(long long a, long long b, long long m = mod_v) {
  return mod(mod(a, m) * mod(b, m), m);
}
inline long long quotient(long long a, long long b, long long m = mod_v) {
  return mod(mod(a, m) * mod_inv(b, m), m);
}
template <typename T, typename T2>
ostream &operator<<(ostream &s, const pair<T, T2> &p) {
  return s << p.first << ' ' << p.second << ' ';
}
template <typename T, typename T2>
istream &operator>>(istream &s, pair<T, T2> &p) {
  return s >> p.first >> p.second;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
  for (auto it : v) s << it << ' ';
  return s;
}
template <typename T>
istream &operator>>(istream &s, vector<T> &v) {
  for (auto it = (v).begin(), it_ = (v).end(); it != it_; ++it) s >> *it;
  return s;
}
template <typename T>
void read_range(T beg, T end) {
  while (beg != end) cin >> *beg++;
}
template <typename T>
void print_range(T beg, T end) {
  while (beg != end) cout << *beg++ << ' ';
}
struct reader {
  template <typename T>
  reader &operator,(T &v) {
    cin >> v;
    return *this;
  }
} rdr;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << ", ";
    return *this;
  }
} dbg;
pair<int, int> ar[max_n];
int ps[max_n], c[205], d[205];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  rdr, n;
  ;
  for (int i = 0, i_ = (n); i < i_; ++i) cin >> ar[i].first;
  for (int i = 0, i_ = (n); i < i_; ++i) cin >> ar[i].second;
  sort(ar, ar + n);
  ps[0] = ar[0].second;
  for (int i = 0, i_ = (n - 1); i < i_; ++i)
    ps[i + 1] += ps[i] + ar[i + 1].second;
  int mn = inf;
  for (int i = 0, i_ = (n); i < i_; ++i) {
    int j = i, sm = 0;
    memset(d, 0, sizeof(d));
    while (j < n and ar[j].first == ar[i].first) ++d[ar[j++].second];
    --j;
    int cnt = j - i + 1, cost = ps[n - 1] - ps[j];
    if (i >= cnt) {
      int rmv = i - cnt + 1, k = 0;
      while (rmv) cost += min(c[k], rmv) * k, rmv -= min(c[k++], rmv);
    }
    for (int k = 0, k_ = (201); k < k_; ++k) c[k] += d[k];
    i = j;
    if (cost < mn) mn = cost;
  }
  cout << mn << '\n';
  return 0;
}
