#include<cstdio>
#include<iostream>
#include<cstring>
struct goods{
long v,p,x;
};
goods pack[70][10];
long dp[70][33000];
int count[70],s[70];
int main()
{
memset(s,0,sizeof(s));
memset(count,0,sizeof(count));
memset(dp,0,sizeof(dp));
int v,m,l;
long x,y,cou(1),cou1(0);
scanf("%d%d",&v,&m);
for(int i=0;i<m;i++)
{
scanf("%ld%ld%d",&x,&y,&l);
cou1++;
if(l==0)
{
s[cou1]=cou;
pack[cou][count[cou]].v=x;
pack[cou][count[cou++]].p=y;
}else{
count[s[l]]++;
pack[s[l]][count[s[l]]].v=x;
pack[s[l]][count[s[l]]].p=y;}}
for(int i=1;i<cou;i++)
{
pack[i][0].x=pack[i][0].v*pack[i][0].p;
if(count[i]==1)
{
pack[i][1].x=pack[i][0].x+pack[i][1].p*pack[i][1].v;
pack[i][1].v+=pack[i][0].v;
}
else if(count[i]==2){
pack[i][3].x=pack[i][0].x;
for(int j=1;j<3;j++)
{
pack[i][j].x=pack[i][j].v*pack[i][j].p;
pack[i][3].x+=pack[i][j].x;
pack[i][j].x+=pack[i][0].x;
pack[i][j].v+=pack[i][0].v;
}
pack[i][3].v=pack[i][1].v+pack[i][2].v-pack[i][0].v;
count[i]++;
}
}
for(int i=1;i<cou;i++)
for(int k=0;k<=count[i];k++)
for(int j=0;j<=v;j++)
{
if(j-pack[i][k].v>=0)
dp[i][j]=std::max(dp[i][j],dp[i-1][j-pack[i][k].v]+pack[i][k].x);
dp[i][j]=std::max(dp[i][j],dp[i-1][j]);
}
printf("%ld\n",dp[cou-1][v]);
return 0;
}
然后还厚颜无耻的拿了一下题解的c++代码试了下，打表的那个过了，但是2L那位的就WA了