E Two Matchings

题解链接：https://blog.csdn.net/m0_43448982/article/details/107431309

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+10;
ll a[maxn];
ll dp[maxn];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
            dp[i]=0;
        }
        sort(a+1,a+n+1);
        dp[4]=a[4]-a[1];
        dp[6]=a[6]-a[1];
        dp[8]=dp[4]+a[8]-a[5];
        for(int i=10;i<=n;i+=2){
            dp[i]=min(dp[i-4]+a[i]-a[i-3],dp[i-6]+a[i]-a[i-5]);
        }
        printf("%lld\n",dp[n]*2);
    }
    return 0;
}