백준 온라인 저지(Baekjoon Online Judge) - 9063 : 대지

https://www.acmicpc.net/problem/9063

9063번: 대지

 

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

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> x, y;
    for (int i = 0; i < n; i++) {
        int xi, yi;
        cin >> xi >> yi;
        x.push_back(xi);
        y.push_back(yi);
    }

    int min_x = *min_element(x.begin(), x.end());
    int max_x = *max_element(x.begin(), x.end());
    int min_y = *min_element(y.begin(), y.end());
    int max_y = *max_element(y.begin(), y.end());

    int area = (max_x - min_x) * (max_y - min_y);
    cout << area << endl;

    return 0;
}