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

def solution(sizes):
    max_w, max_h = 0, 0
    
    for w, h in sizes:
        if w < h:
            w, h = h, w
        if max_w < w:
            max_w = w
        if max_h < h:
            max_h = h
    
    return max_w * max_h