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

 

• 풀이

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<vector<int>> sizes) {
    int answer = 0;
    int width=0, height=0;
    for(int i=0; i<sizes.size(); i++){
        sort(sizes[i].begin(), sizes[i].end());
    }
    for(int i=0; i<sizes.size(); i++){
        if(sizes[i][0] > width) width = sizes[i][0];
        if(sizes[i][1] > height) height = sizes[i][1];
    }
    return width * height;
}