[JAVA] 프로그래머스 Lv.1 최소직사각형

import java.util.*;
class Solution {
    public int solution(int[][] sizes) {
        int answer = 0;
        int max_0 = 0;
        int max_1 = 0;
        
        for(int i=0; i<sizes.length; i++){
            Arrays.sort(sizes[i]);
            if(max_0 < sizes[i][0]){
                max_0 = sizes[i][0];
            } 
            if(max_1 < sizes[i][1]){
                max_1 = sizes[i][1];
            }
        }
        answer = max_0 * max_1;
        return answer;
    }
}