Submission #1533207

---

Source Code Expand

#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
	int n;
	cin >> n;
	vector<pll> v(n);
	rep(i, n) {
		cin >> v[i].fi >> v[i].se;
		if(v[i].fi > v[i].se) swap(v[i].fi, v[i].se);
	}
	sort(all(v));
	ll m = v[0].se, M = v[0].se;
	REP(i, 1, n) {
		m = min(m, v[i].se);
		M = max(m, v[i].se);
	}
	cout << min(abs((M - m) * (v.back().fi - v[0].fi)), abs((M - v[0].fi) * (v.back().fi - m))) << endl;
	return 0;
}

Submission Info

Judge Result