问题转化和性质分析都很巧妙
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=22;
int dp[1<<maxn],num[maxn],sum[1<<maxn];
int main()
{
freopen("in.txt","r",stdin);
int n,m,N;
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",&num[i]);
scanf("%d",&m);
for(int i=n+1;i<=n+m;++i)
{
scanf("%d",&num[i]);
num[i]=-num[i];
}
N=n+m;
for(int i=1;i<(1<<N);++i)
{
sum[i]=0;
for(int j=1;j<=N;++j)
{
if(i&(1<<(j-1)) )
{
sum[i]+=num[j];
dp[i]=max(dp[i],dp[i^(1<<(j-1))]);
}
}
if(sum[i]==0)++dp[i];
}
printf("%d",n+m-2*dp[(1<<N)-1]);
return 0;
}