【洛谷 P2409】Y的积木（dp（01背包））

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int f[110][10010];
int a[110][110],m[110],n,k,sumx,summ;
int main()
{
freopen("int.txt","r",stdin);
freopen("my.txt","w",stdout);
int i,j;
memset(f,0,sizeof(f));
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
{
int maxn=0,minn=0x7fffffff;
scanf("%d",&m[i]);
for(j=1;j<=m[i];++j)
{
scanf("%d",&a[i][j]);
if(a[i][j]>maxn) maxn=a[i][j];
if(a[i][j]<minn) minn=a[i][j];
}
sumx+=maxn;
}
f[0][0]=1;
for(i=1;i<=n;++i)
for(j=1;j<=m[i];++j)
for(int h=sumx;h>=a[i][j];h--)
if(f[i-1][h-a[i][j]])
f[i][h]+=f[i-1][h-a[i][j]];
for(i=1;i<=sumx;++i)
if(k)
for(j=1;j<=f
[i];++j)
if(k) printf("%d ",i),k--;
else return 0;
else return 0;
}