[프로그래머스 / C++] Lv 1. 최소직사각형

문제

문제풀이

풀이

#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<vector<int>> sizes) {
    int answer = 0;
    int height = 0;
    int width = 0;

    for (int i = 0; i < sizes.size(); i++) {
        if (sizes[i][0] > sizes[i][1])
        {
            height = max(height, sizes[i][0]);
            width = max(width, sizes[i][1]);
        }
        else
        {
            height = max(height, sizes[i][1]);
            width = max(width, sizes[i][0]);
        }
    }

    answer = height * width;
    return answer;
}