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

class Solution {
    public int solution(int[][] sizes) {
        int max1 = 1;
        int max2 = 1;
        
        for (int[] i : sizes) {
            max1 = Math.max(max1, Math.max(i[0], i[1]));
            max2 = Math.max(max2, Math.min(i[0], i[1]));
        }
        return max1 * max2;
    }
}