1 solutions

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

    Information

    ID
    210
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    (None)
    # Submissions
    67
    Accepted
    15
    Uploaded By