2 solutions

  • 2
    @ 2024-10-16 20:08:57
    #include<bits/stdc++.h>
    using namespace std;
    const int N=25,M=85;
    int f[N][M];
    int main()
    {
    	int v,m,n;
    	cin>>v>>m>>n;
    	memset(f,0x3f,sizeof f);
    	f[0][0]=0;
    	for(int k=1;k<=n;k++)
        {
    		int v1,m1,w;
    		cin>>v1>>m1>>w;
    		for(int i=v;i>=0;i--)
            {
    			for(int j=m;j>=0;j--)
                {
    				f[i][j]=min(f[i][j],f[max(0,i-v1)][max(0,j-m1)]+w);
    			}
    		}
    	}
    	cout<<f[v][m];
    	return 0;
    }
    • 1
      @ 2024-10-16 20:15:16

      • 1

      Information

      ID
      994
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      5
      Tags
      (None)
      # Submissions
      13
      Accepted
      4
      Uploaded By