Submission #1534659

---

Source Code Expand

#include <iostream>
using namespace std;
int main(){
  int N;
  cin >> N;
  long long int INF = 100000000, X[N], Y[N], R_min = INF, B_min = INF, M = 0, R_max, B_max;
  for(int i = 0; i < N; ++i){
    cin >> X[i] >> Y[i];
    if(min(X[i],Y[i]) < B_min){
      B_min = min(X[i],Y[i]);
      R_max = max(X[i],Y[i]);
    }
    if(max(X[i],Y[i]) < R_min){
      R_min = max(X[i],Y[i]);
      B_max = min(X[i],Y[i]);
    }
    M = max(M,max(X[i],Y[i]));
  }
  for(int i = 0; i < N; ++i){
    if(min(X[i],Y[i]) > R_min){
      B_max = max(min(X[i],Y[i]),B_max);
      R_max = max(min(X[i],Y[i]),R_max);
    }else{
      R_max = max(max(X[i],Y[i]),R_max);
      B_max = max(min(X[i],Y[i]),B_max);
    }
  }
  // cout << R_max << " " << R_min << " " << B_max << " " << B_min << " " << M << endl;
  cout << min((R_max-R_min)*(M-B_min),(M-R_min)*(B_max-B_min)) << endl;
  return 0;
}

Submission Info

Judge Result