[Level 1] 최소직사각형

import java.util.*;

class Solution {
    public int solution(int[][] sizes) {
        int w = 0; int h = 0;
        
        for(int i=0; i<sizes.length;i ++) {
            int max = Math.max(sizes[i][0], sizes[i][1]);
            int min = Math.min(sizes[i][0], sizes[i][1]);
            sizes[i][0] = max; sizes[i][1] = min;
        }

        for(int i=0; i<sizes.length; i++) {
            w = Math.max(sizes[i][0], w);
            h = Math.max(sizes[i][1], h);
        }
        
        return w*h;
    }
}