#include <iostream>
using namespace std;
const int N = 1010;
int dp[N][N];
int v[N], w[N];
int main()
{
int n, V;
cin >> n >> V;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i];
}
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= V; j ++)
{
if(j < v[i])
{
dp[i][j] = dp[i - 1][j];
}else
{
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
}
}
}
cout << dp[n][V] << endl;
return 0;
}
AcWing 2.01背包问题
于 2023-03-24 16:36:24 首次发布