Problem:
Score : 700 points

Problem Statement

There are N bags, each containing two white balls. The i-th box contains two balls with integers x_i and y_i written on them, respectively.

For each of these bags, you will paint one of the balls red, and paint the other blue.

Afterwards, the 2N balls will be classified according to color.

Then, we will define the following:

R_{max}: the maximum integer written on a ball painted in red

R_{min}: the minimum integer written on a ball painted in red

B_{max}: the maximum integer written on a ball painted in blue

B_{min}: the minimum integer written on a ball painted in blue

Find the minimum possible value of (R_{max} - R_{min}) \times (B_{max} - B_{min}).

Constraints

1 ≤ N ≤ 200,000

1 ≤ x_i, y_i ≤ 10^9

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
:
x_N y_N

Output

Print the minimum possible value.

Sample Input 1

3
1 2
3 4
5 6

Sample Output 1

15

The optimal solution is to paint the balls with x_1, x_2, y_3 red, and paint the balls with y_1, y_2, x_3 blue.

Sample Input 2

3
1010 10
1000 1
20 1020

Sample Output 2

380

Sample Input 3

2
1 1
1000000000 1000000000

Sample Output 3

999999998000000001

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<bits/stdc++.h>
/*
*/

using namespace std;

int main() {
	long long int N;
	cin >> N;
	vector<pair<long long int, long long int>>D( N );
	vector<long long int>maxidxvec, minidxvec;
	long long int maxv = 0, minv = 200001;
	long long int rmaxv = 0, rminv = 200001;
	long long int bmaxv = 0, bminv = 200001;
	for( size_t i = 0; i < N; i++ ) {
		cin >> D[i].first >> D[i].second;
		long long int memo = D[i].first;
		D[i].first = max( D[i].first, D[i].second );
		D[i].second = min( D[i].second, memo );
		if( maxv < D[i].first ) {
			maxv = D[i].first;
			maxidxvec = vector<long long int>( 1, i );
		} else if( maxv == D[i].first ) {
			maxidxvec.push_back( i );
		}
		if( minv > D[i].second ) {
			minv = D[i].second;
			minidxvec = vector<long long int>( 1, i );
		} else if( minv == D[i].second ) {
			minidxvec.push_back( i );
		}
		rmaxv = max( rmaxv, D[i].first );
		rminv = min( rminv, D[i].first );
		bmaxv = max( bmaxv, D[i].second );
		bminv = min( bminv, D[i].second );
	}
	long long int ans = ( rmaxv - rminv )*( bmaxv - bminv );
	if( maxidxvec.size() != 1 || minidxvec.size() != 1 || maxidxvec[0] != minidxvec[0] ) {
		set<pair<long long int, long long int>>dp;
		long long int maxidx, minidx;
		if( maxidxvec.size() == 1 ) {
			maxidx = maxidxvec[0];
			for( auto y : minidxvec ) {
				if( maxidx != y ) {
					minidx = y;
					break;
				}
			}
		} else {
			minidx = minidxvec[0];
			for( auto x : maxidxvec ) {
				if( minidx != x ) {
					maxidx = x;
					break;
				}
			}
		}
		long long int maxidxvv = D[maxidx].second, minidxvv = D[minidx].first;
		dp.insert( make_pair( min( maxidxvv, minidxvv ), max( maxidxvv, minidxvv ) ) );
		for( size_t i = 0; i < N; i++ ) {
			auto memo = dp;
			for( auto now : memo ) {
				auto next = now;
				next = make_pair( min( D[i].first, next.first ), max( D[i].first, next.second ) );
				if( ( next.second - next.first )*( maxv - minv ) < ans ) {
					dp.insert( next );
				}
				next = now;
				next = make_pair( min( D[i].second, next.first ), max( D[i].second, next.second ) );
				if( ( next.second - next.first )*( maxv - minv ) < ans ) {
					dp.insert( next );
				}
			}
		}
		for( auto now : dp ) {
			ans = min( ans, ( now.second - now.first )*( maxv - minv ) );
		}
	}
	cout << ans << endl;
}