代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>

typedef long long LL;

const int N=2005;

int n,K,L,id[N];
LL f[N][N],a[N],b[N];

bool cmp(int x,int y)
{
	return b[x]>b[y];
}

int main()
{
	int T;scanf("%d",&T);
	while (T--)
	{
		scanf("%d%d%d",&n,&K,&L);
		for (int i=1;i<=n;i++) scanf("%lld",&a[i]);
		for (int i=1;i<=n;i++) scanf("%lld",&b[i]);
		for (int i=1;i<=n;i++) id[i]=i;
		std::sort(id+1,id+n+1,cmp);
		for (int i=1;i<=n;i++)
			for (int j=0;j<=i;j++)
			{
				f[i][j]=0; 
				if (i<=K&&(j>=L||j<L&&K-i>=L-j)) f[i][j]=std::max(f[i][j],f[i-1][j]+b[id[i]]);
				else f[i][j]=std::max(f[i][j],f[i-1][j]);
				if (!j) continue;
				if (j<=L||i<=K) f[i][j]=std::max(f[i][j],f[i-1][j-1]+a[id[i]]+b[id[i]]);
				else f[i][j]=std::max(f[i][j],f[i-1][j-1]+a[id[i]]);
			}
		printf("%lld\n",f[n][K]);
	}
	return 0;
}

评测结果