https://programmers.co.kr/learn/courses/30/lessons/86491
def solution(sizes):
answer = 0
w=0
h=0
for i in range(len(sizes)):
sizes[i].sort(reverse=True)
w=max(w,sizes[i][0])
h=max(h,sizes[i][1])
answer=w*h
return answer
def solution(sizes):
return max(max(x) for x in sizes) * max(min(x) for x in sizes)