Score : 700 points
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:
Find the minimum possible value of (R_{max} - R_{min}) \times (B_{max} - B_{min}).
Input is given from Standard Input in the following format:
N x_1 y_1 x_2 y_2 : x_N y_N
Print the minimum possible value.
3 1 2 3 4 5 6
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.
3 1010 10 1000 1 20 1020
380
2 1 1 1000000000 1000000000
999999998000000001