# UUID: 96bde295-3d14-4621-84f5-d5538e9a4195
def solvx():
    import sys

    data = sys.stdin.read().strip().split()
    N = int(data[0])

    A = list(map(int, data[1:1+N]))
    B = list(map(int, data[1+N:1+2*N]))

    idx = list(range(N))
    idx.sort(key=lambda i: A[i])

    prefix = [0]*(N+1)
    for j in range(N):
        prefix[j+1] = prefix[j] + B[idx[j]]

    ketpercesek = 0

    for pos in range(N-1, -1, -1):
        i = idx[pos]
        if A[i] > ketpercesek + prefix[pos]:
            if ketpercesek + prefix[pos] + B[i] > A[i]:
                ketpercesek += A[i] - (ketpercesek + prefix[pos])
            else:
                ketpercesek += B[i]

    print(ketpercesek + prefix[N])

def solv():
    N = int(input())
    prefix = [int(x) for x in input().split()] + [0]
    V = [(prefix[i],int(x)) for i,x in enumerate(input().split())]

    V.sort()

    prefix[0] = 0
    prefix[1] = V[0][1]
    for i in range(1, N):
        prefix[i + 1] = prefix[i] + V[i][1]

    ketpercesek = 0

    for i in range(N - 1, -1, -1):
        if V[i][0] > ketpercesek + prefix[i]:
            if ketpercesek + prefix[i] + V[i][1] > V[i][0]:
                ketpercesek += V[i][0] - (ketpercesek + prefix[i])
            else:
                ketpercesek += V[i][1]

    print(ketpercesek + prefix[N])


solvx()