Codeforces Round #500 (Div. 2) [based on EJOI] C - Photo of The Sky

http://codeforces.com/contest/1013/problem/C

题意：给你2*n个数，让你把其分为两组，一组为x坐标集合，一组为y坐标，将其进行组合为（x，y）坐标，使得所有坐标被一矩形包含，并是该矩形面积最小，输出面积

思路：先排序，面积分两种情况，一种是(a[2 * n - 1] - a[n]) * (a[n - 1] - a[0])，另一种(a[2 * n - 1] - a[0]) * (a[n + i - 1] - a[i]) （0<i<n）。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long

const int maxn = 2e5+50;
int n;
ll a[maxn];

int main()
{
        scanf("%d", &n);
        for (int i = 0; i < 2*n; i ++) {
                scanf("%lld", &a[i]);
        }
        sort (a, a + 2*n);
        ll ans = (a[n-1]-a[0])*(a[2*n-1]-a[n]), wer = 0;
        for (int i = 1; i < n; i ++) {
                wer = (a[2 * n - 1] - a[0]) * (a[n + i - 1] - a[i]);
                ans = min (ans, wer);
        }
        printf("%lld\n", ans);
}