Group Backpack

All items are divided into k Group , Intra group mutual exclusion

Pair up 01 knapsack , Which of the last one-dimensional enumeration group

#include<bits/stdc++.h>
using namespace std;
int dp[1005];
struct one{
    int m,w;
};
vector <one> v[1005];
int main()
{
    int n,m;
    cin>>m>>n;
    int a,b,c;
    for(int i=1;i<=n;++i)
    {
        cin>>a>>b>>c;
        v[c].push_back((one){a,b});
    }
    for(int i=1;i<=1000;++i)
    {
        if(v[i].size())
        {
            for(int j=m;j>=0;--j)
            {
                for(int k=0;k<v[i].size();++k)
                {
                    if(j>=v[i][k].m)
                    dp[j]=max(dp[j],dp[j-v[i][k].m]+v[i][k].w);
                }
            }
        }
    }
    cout<<dp[m];
    return 0;
}

  Group backpack of Tongtian - Luogu