#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int> a = {0}, b = {0};
	vector<int> dir(n);
	for (int i = 0; i < n; i++) {
		cin >> dir[i];
	}
	
	for (int i = 0; i < n; i++) {
		int x; cin >> x;
		((dir[i] == 0) ? a : b).push_back(x);
	}

	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	n = a.size() - 1;
	int m = b.size() - 1;
	vector<vector<int>> dp(n + 1, vector<int>(m + 1, 1e9));
	dp[0][0] = 0;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int time = max(a[i], b[j]);
			int awaiting = 0;
			for (int x = 0; x < i; x++) { // x ember megy meg vele
				awaiting += time - a[i - x];
				int bwaiting = 0;
				for (int y = 1; y < j; y++) { // y ember megy meg vele
					bwaiting += time - b[j - y];
					dp[i][j] = min(dp[i][j], dp[i - x - 1][j - y - 1] + awaiting + bwaiting);
				}
			}
			// cout << dp[i][j] << " ";
		}
		// cout << "\n";
	}
	cout << dp[n][m];
}