from sys import stdin
input=stdin.readline

def pre(X):
 for i in range(1,len(X)):X[i]+=X[i-1]
 return X

memo={}

def main():
 N=int(input())
 C=list(map(int,input().split()))
 T=list(map(int,input().split()))
 B=[]
 J=[]
 for i in range(N):
  if C[i]==0:B.append(T[i])
  else:J.append(T[i])
 B.sort()
 J.sort()
 preB=pre(B[:])
 preJ=pre(J[:])

 def sol(x,y):
  if (x,y) in memo:
   return memo[(x,y)]
  last=max(B[x-1],J[y-1])
  res=(x+y)*last-preB[x-1]-preJ[y-1]
  if x==1 or y==1:
   return res
    
  for X in range(1,x):
   for Y in range(1,y):
    last=max(B[x-1],J[y-1])
    res=min(res,sol(X,Y)+last*(x-X+y-Y)-preB[x-1]-preJ[y-1]+preB[X-1]+preJ[Y-1])
  memo[(x,y)]=res
  return res
 
 print(sol(len(B),len(J)))

main()