#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> dir(n);
    for (int i = 0; i < n; i++)
        cin >> dir[i];

    vector<long long> A(1, 0), B(1, 0); // 1index

    for (int i = 0; i < n; i++) {
        long long t;
        cin >> t;
        if (dir[i] == 1)
            A.push_back(t);
        else
            B.push_back(t);
    }

    sort(A.begin() + 1, A.end());
    sort(B.begin() + 1, B.end());

    int x = A.size() - 1;
    int y = B.size() - 1;

    const long long INF = 1e18;
    vector<vector<long long>> dp(x + 1, vector<long long>(y + 1, INF));

    dp[0][0] = 0;

    for (int i = 1; i <= x; i++) {
        for (int j = 1; j <= y; j++) {

            long long meet_time = max(A[i], B[j]);
            long long wait = meet_time - B[j];
            for (int k = i; k >= 1; k--) {
                wait += meet_time - A[k];
                dp[i][j] = min(dp[i][j], dp[k - 1][j - 1] + wait);
            }

            wait = meet_time - A[i];
            for (int k = j; k >= 1; k--) {
                wait += meet_time - B[k];
                dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] + wait);
            }
        }
    }

    cout << dp[x][y] << endl;

    return 0;
}