Submission #2667309

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<pair<ll, ll>> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
        if (a[i].first > a[i].second) {
            swap(a[i].first, a[i].second);
        }
    }
    sort(a.begin(), a.end());
    ll ans = (a[n - 1].first - a[0].first) * (a[n - 1].second - a[0].second);
    ans = min(ans, (a[n - 1].second - a[0].first) * abs(a[0].second - a[n - 1].first));
    cout << ans;
    return 0;
}

Submission Info

Judge Result