# UUID: 9ec0d032-5920-433d-b2cf-ed317ad7d488
from array import array

def solvx():
    N = int(input())
    A = array('l', [int(x) for x in input().split()])
    B = array('l', [int(x) for x in input().split()])
    
    def merge_sort(lo, hi):
        if hi - lo <= 1:
            return
        mid = (lo + hi) // 2
        merge_sort(lo, mid)
        merge_sort(mid, hi)

        i, j = lo, mid
        while i < j and j < hi:
            if A[i] <= A[j]:
                i += 1
            else:
                ai = A[j]
                bi = B[j]
                k = j
                while k > i:
                    A[k] = A[k-1]
                    B[k] = B[k-1]
                    k -= 1
                A[i] = ai
                B[i] = bi
                i += 1
                j += 1

    merge_sort(0, N)

    total_second = sum(B)
    ketpercesek = 0
    running_prefix = total_second

    for pos in range(N - 1, -1, -1):
        running_prefix -= B[pos]

        if A[pos] > ketpercesek + running_prefix:
            need = A[pos] - (ketpercesek + running_prefix)
            if need < B[pos]:
                ketpercesek += need
            else:
                ketpercesek += B[pos]

    print(ketpercesek + total_second)

solvx()