[31일차][프로그래머스][완전탐색][86491]최소직사각형

def solution(sizes):
    all_sizes = []
    for data in sizes:
        all_sizes.append(data[0])
        all_sizes.append(data[1])
    
    max_sizes = max(all_sizes)
    all_sizes = sorted(set(all_sizes), reverse=True)
    
    check_arr = []
    for data in sizes:
        for size in all_sizes:   
            if (data[0] > size or data[0] > max_sizes) and (data[1] > size or data[1] > max_sizes):
                check_arr.append(size)
                    
    for data in set(check_arr):
        if data in all_sizes:
            del all_sizes[all_sizes.index(data)]
    
    return max_sizes * min(all_sizes)