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

 

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

using namespace std;

int solution(vector<vector<int>> sizes) {
    int max_w = 0;
    int max_h = 0;
    for(int i=0; i<sizes.size(); i++){
        for(int j=0; j<sizes[0].size(); j++){
            sort(sizes[i].begin(),sizes[i].end(), greater<int>());
        }
        cout<<sizes[i][0]<<" "<<sizes[i][1]<<"\n";
        if(max_w<sizes[i][0]){
            max_w = sizes[i][0];
        }
        if(max_h<sizes[i][1]){
            max_h = sizes[i][1];
        }
    }
    cout <<"max_w:"<<max_w <<" max_h:"<<max_h;
    return max_w*max_h;
}