分组背包问题

输入样例

3 5
2
1 2
2 4
1
3 4
1
4 5

输出样例

8

代码

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;

const int N = 210;
int n, m;
int v[N][N], w[N][N],s[N];
int f[N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> s[i];
        for (int j = 0; j < s[i]; j++)
            cin >> v[i][j] >> w[i][j];
    }

    for (int i = 1; i <= n; i++)//遍历组数
        for (int j = m; j >= 0; j--)
            for (int k = 0; k < s[i]; k++)
                if (v[i][k] <= j)
                    f[j] = max(f[j], f[j - v[i][k]] + w[i][k]);//第i组第i个物品

    cout << f[m];
    return 0;
}