1 solutions

  • -3
    @ 2024-7-10 11:21:46
    #include<bits/stdc++.h>
    using namespace std;
    const int N=110;
    int f[N],v[N][N],w[N][N],s[N];
    int main()
    {
    	int n,V;
    	cin>>n>>V;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>s[i];
    		for(int j=1;j<=s[i];j++)
    		{
    			cin>>v[i][j]>>w[i][j];
    		}
    	}
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=V;j>=0;j--)
    		{
    			for(int k=1;k<=s[i];k++)
    			{
    				if(j>=v[i][k])
    				{
    					f[j]=max(f[j],f[j-v[i][k]]+w[i][k]);
    				}
    			}
    		}
    	}
    	cout<<f[V];
    	return 0;
    }
    
    • 1

    Information

    ID
    206
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    # Submissions
    32
    Accepted
    13
    Uploaded By