题意:n个a,n个b,两两配对
代价为abs(a-b),相同的不能配对
问最小代价
有事没事排排序
被我合理演绎(猜)出的结论:每个数不会与距离超过2的数配对
然后就是,字面意思的dp
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define mmst(a, b) memset(a, b, sizeof(a))
#define mmcp(a, b) memcpy(a, b, sizeof(b))
#define imin(a, b) ((a) < (b)) ? (a) : (b)
typedef long long LL;
const int N=100100;
const LL oo=1e15;
int n;
LL a[N],b[N],dp[N];
int A[6]={0,0,1,1,2,2};
int B[6]={1,2,0,2,0,1};
int C[6]={2,1,2,0,1,0};
LL val(int x,int y)
{
return (x==y) ? oo : abs(x-y);
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
scanf("%lld%lld",&a[i],&b[i]);
sort(a+1,a+n+1);
sort(b+1,b+n+1);
dp[1]=val(a[1],b[1]);
dp[2]=imin(dp[1]+val(a[2],b[2]),val(a[1],b[2])+val(a[2],b[1]));
for(int i=3;i<=n;i++)
{
dp[i]=oo;
dp[i]=imin(dp[i],dp[i-1]+val(a[i],b[i]));
dp[i]=imin(dp[i],dp[i-2]+val(a[i],b[i-1])+val(a[i-1],b[i]));
for(int j=0;j<6;j++)
dp[i]=imin(dp[i],dp[i-3]+val(a[i-2],b[i-A[j]])+val(a[i-1],b[i-B[j]])+val(a[i],b[i-C[j]]));
}
if(dp[n]<oo)
cout<<dp[n]<<endl;
else
cout<<-1<<endl;
return 0;
}