[백준][Python] 1026번 보물

n = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
product = 0
for i in range(n):
    product += min(A) * max(B)
    A.pop(A.index(min(A)))
    B.pop(B.index(max(B)))
print(product)