#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5, inf = 1e18, mod = 1e9 + 7;
const double PI = 3.1415926536;
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <typename T>
ostream& operator<<(ostream& out, const vector<T>& mas) {
  for (const auto& x : mas) {
    out << x << ' ';
  }
  out << '\n';
  return out;
}
bool is_prime(long long n) {
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
inline long long getPow(long long a, long long b) {
  long long res = 1ll, tp = a;
  while (b) {
    if (b & 1ll) {
      res *= tp;
    }
    tp *= tp;
    b >>= 1ll;
  }
  return res;
}
long long vec_mult(const pair<long long, long long>& t1,
                   const pair<long long, long long>& t2,
                   const pair<long long, long long>& t3) {
  const long long &x1 = t1.first, y1 = t1.second;
  const long long &x2 = t2.first, y2 = t2.second;
  const long long &x3 = t3.first, y3 = t3.second;
  return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1));
}
void ok() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }
inline long long nxt() {
  long long x;
  cin >> x;
  return x;
}
struct SegmTree {
  int n;
  vector<long long> tree;
  vector<long long> to_add;
  SegmTree(int n) {
    this->n = n;
    tree.resize(n * 4 + 10);
    to_add.resize(n * 4 + 10);
  }
  void push(int v) {
    tree[v * 2] += to_add[v];
    tree[v * 2 + 1] += to_add[v];
    to_add[v * 2] += to_add[v];
    to_add[v * 2 + 1] += to_add[v];
    to_add[v] = 0;
  }
  void add(int v, int l, int r, int tl, int tr, long long x) {
    if (tl > r || l > tr || l > r || tl > tr) return;
    if (l >= tl && r <= tr) {
      tree[v] += x;
      to_add[v] += x;
      return;
    }
    int md = (l + r) / 2;
    push(v);
    add(v * 2, l, md, tl, tr, x);
    add(v * 2 + 1, md + 1, r, tl, tr, x);
    tree[v] = min(tree[v * 2], tree[v * 2 + 1]);
  }
  void add(int l, int r, long long x) {
    if (r >= l) add(1, 0, n - 1, l, r, x);
  }
  long long get(int v, int l, int r, int tl, int tr) {
    if (l > tr || tl > r) {
      return inf;
    }
    if (tl <= l && r <= tr) {
      return tree[v];
    }
    push(v);
    int md = (l + r) / 2;
    return min(get(v * 2, l, md, tl, tr), get(v * 2 + 1, md + 1, r, tl, tr));
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n = nxt();
  vector<int> p(n);
  vector<long long> a(n);
  SegmTree tree(n);
  for (int i = 0; i < n; i++) {
    p[i] = nxt() - 1;
  }
  for (int i = 0; i < n; i++) {
    a[i] = nxt();
    tree.add(p[i], n - 1, a[i]);
  }
  long long ans = min(a[0], a[n - 1]);
  for (int i = 0; i < n - 1; i++) {
    tree.add(0, p[i] - 1, a[i]);
    tree.add(p[i], n - 1, -a[i]);
    ans = min(ans, tree.tree[1]);
  }
  cout << ans;
  return 0;
}
