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

class Solution {
    public int solution(int[][] sizes) {
        int answer = 0;
        
        for(int i=0; i<sizes.length; i++){
            if(sizes[i][0]>sizes[i][1]){
                int temp = sizes[i][0];
                sizes[i][0] = sizes[i][1];
                sizes[i][1] = temp;
            }
        }
        
        int max = 0;
        int max2 = 0;
        
        for(int i=0; i<sizes.length; i++){
            if(max<sizes[i][0]){
                max = sizes[i][0];
            }
            if(max2<sizes[i][1]){
                max2 = sizes[i][1];
            }
        }
        answer = max * max2;
        return answer;
    }
}