[레벨 1 ] 최소직사각형 만들기

#include <string>
#include <vector>

using namespace std;

int solution(vector<vector<int>> sizes) {
    int maxX = - 987654321,maxY = -987654321;
    int len = sizes.size();
    for(int i = 0; i < len; ++i)
    {
        if(sizes[i][0] > sizes[i][1])
        {
            int temp = sizes[i][0];
            sizes[i][0] = sizes[i][1];
            sizes[i][1] = temp;
        }
    }
    for(int i = 0; i < len; ++i)
    {
        if(maxX < sizes[i][0])
            maxX = sizes[i][0];
        
        if(maxY < sizes[i][1])
            maxY = sizes[i][1];
    }
    return maxX * maxY;
}