每日一题 <P1507 NASA的食物计划>

#include<iostream>
using namespace std;
int m, v;
int i, j, n, w[51]/*体积*/, t[52]/*质量*/, k[51], dp[401][501];
int main()
{
  cin >> v >> m >> n;
  for (int i = 1; i <= n; i++)
  {
    cin >> w[i] >> t[i] >> k[i];
  }
  for (int i = 1; i <= n; i++)
  {
    for (int j = v; j >= w[i]; j--)
    {
      for (int z = m; z >= t[i]; z--)
      {
        dp[j][z] = max(dp[j - w[i]][z - t[i]] + k[i], dp[j][z]);
      }
    }
  }
  cout << dp[v][m];
  return 0;
}