贪心 C - Kayaking

题目
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.

Now the party is ready to start its journey, but firstly they have to choose kayaks. There are 2·n people in the group (including Vadim), and they have exactly n - 1 tandem kayaks (each of which, obviously, can carry two people) and 2 single kayaks. i-th person’s weight is w i, and weight is an important matter in kayaking — if the difference between the weights of two people that sit in the same tandem kayak is too large, then it can crash. And, of course, people want to distribute their seats in kayaks in order to minimize the chances that kayaks will crash.

Formally, the instability of a single kayak is always 0, and the instability of a tandem kayak is the absolute difference between weights of the people that are in this kayak. Instability of the whole journey is the total instability of all kayaks.

Help the party to determine minimum possible total instability!

Input
The first line contains one number n (2 ≤ n ≤ 50).

The second line contains 2·n integer numbers w 1, w 2, …, w 2n, where w i is weight of person i (1 ≤ w i ≤ 1000).

Output
Print minimum possible total instability.

Examples
Input
2
1 2 3 4
Output
1
Input
4
1 3 4 6 3 4 100 200
Output
5

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
long long a[1000];
long long b[1000];
int main()
{
    int n;
    scanf("%d", &n);
    {
        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        for (int i = 1; i <= 2 * n; i++)
        {
            scanf("%lld", &a[i]);
        }
        int N = 2 * n;
        long long max = 1000000;
        sort(a + 1, a + N + 1);
        for (int i = 1; i < 2 * n; i++)
        {
            for (int j = i + 1; j <= 2 * n; j++)
            {
                long long ans = 0;
                int x = 0;
                for (int k = 1; k <= 2 * n; k++)
                {
                    if (k != i && k != j)
                    {
                        b[x++] = a[k];
                        if (x % 2 == 0)
                            ans += (abs(b[x - 1] - b[x - 2]));
                    }
                }
                max = min(max, ans);
            }
        }
        printf("%lld\n", max);
    }
}