knapsack problem AcWing 9. Group knapsack problem

Original link

AcWing 9. Group knapsack problem

Algorithm tags

knapsack problem DP

Ideas

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 105;
int s[N];
int v[N][N], w[N][N],f[N];
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n=read(), vv=read();
    rep(i, 1, n+1){
        s[i]=read();
        rep(j, 0, s[i]){
             v[i][j]=read(), w[i][j]=read();
        }
    }
    // n Group items 
    rep(i, 1, n+1){
    	//  The remaining capacity of the backpack   Because items can only be used once   So cycle from large to small 
        Rep(j, vv, 0){
        	//  The first i Select an item in the group to maximize the value 
            rep(k, 0, s[i]){
                if(v[i][k]<=j){
                    f[j]=max(f[j], f[j-v[i][k]]+w[i][k]);
                }
            }
        }
    }
    printf("%lld", f[vv]);
    return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support