백준 1026

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

a.sort()
b.sort(reverse=True)

result = 0

for i in range(n):
    result = result + a[i] * b[i]

print(result)

 

 

제일 큰 수는 제일 작은 수랑 곱해서 더해주면됨

b를 sort한건 배열을 재배열한게 아니라 b의 크기에 따라 a를 딱딱 대입해줘도 되지만 복잡하니까 쉽게 그 효과를 보기 위해서 저렇게 함