[프로그래머스] 최소 직사각형

def solution(sizes):
    max_in_sizes = 0 
    less_than_maxs = []
    for i in sizes:
        if i[0] >= i[-1]:
            less_than_maxs.append(i[-1])
        elif i[0] < i[-1]:
            less_than_maxs.append(i[0])
        for j in i:
            if j > max_in_sizes:
                max_in_sizes = j
            else:
                continue
    
    return max_in_sizes * max(less_than_maxs)