Kayaking 2 codeforces

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n,a[200],sum=0,mx=0x3f3f3f3f;cin>>n;
    for(int i=0;i<(2*n);i++){cin>>a[i];}
    sort(a,a+n*2);
    for(int i=0;i<(2*n-1);i++)
    {
        for(int j=i+1;j<2*n;j++)
        {
            sum=0;
            for(int k=0;k<(2*n-1);)
            {
                if (k==i || k==j)k++;
                else if ((k+1)!=i || (k+1)!=j){sum+=(a[k+1]-a[k]);k+=2;}
                else if ((k+2)==j){sum+=(a[k+3]-a[k]);k+=4;}
                else if ((k+1)==i){sum+=(a[k+2]-a[k]);k+=3;}
            }
            mx=min(mx,sum);
        }
    }
    cout<<mx<<endl;
}