Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <algorithm>#include <cstdio>#include <map>#include <cstring>using namespace std;typedef long long ll;int N;vector<pair<ll, ll> > v;const ll inf = 0x3f3f3f3f3f3f3f3f;int main(){scanf("%d", &N);for(int i=0; i<N; i++) {ll x, y;scanf("%lld%lld", &x, &y);v.push_back(make_pair(x, y));}int len = v.size();ll ans = inf;for(int i=0; i<len; i++) {for(int j=0; j<len; j++) {if(v[i].first < v[j].first && v[i].second > v[j].second) {if(find(v.begin(), v.end(), make_pair(v[i].first, v[j].second)) != v.end() &&find(v.begin(), v.end(), make_pair(v[j].first, v[i].second)) != v.end()) {ans = min(ans, (v[i].second-v[j].second) * (v[j].first-v[i].first));}}}