1. #include <iostream>
    2. #include <algorithm>
    3. using namespace std;
    5. class Solver {
    6.     static const int MAXN = 100 + 5;
    7.     static const int INF = 0x3f3f3f3f; 
    8.     int dp[MAXN] = {}, v[MAXN], w[MAXN];
    9.     int V, n;
    11.     void zeroOnePack() {
    12.         for (int i = V; i >= 0; i--) {
    13.             for (int j = 0; j < n; j++) 
    14.                 if (i >= v[j]) dp[i] = max(dp[i], dp[i - v[j]] + w[j]);
    15.         }
    16.     }
    18. public:
    19.     void f() {
    20.         int N;
    21.         cin >> N >> V;
    22.         while (N--) {
    23.             cin >> n;
    24.             for (int i = 0; i < n; i++) cin >> v[i] >> w[i];
    25.             zeroOnePack();
    26.         }
    27.         cout << dp[V] << endl;
    28.     }
    29. };
    31. int main() {
    32.     Solver s;
    33.     s.f();
    34. }