#include <iostream>
#define int long long
using namespace std;
const int maxn = 1000 + 5;
int volume[maxn], worth[maxn], dp[maxn];
signed main()
{
int n, v;
cin >> n >> v;
for (int i = 1; i <= n; i ++)
{
scanf("%lld %lld", &volume[i], &worth[i]);
}
for (int i = 1; i <= n; i ++)
{
for (int j = v; j >= volume[i]; j --)
{
dp[j] = max(dp[j], dp[j - volume[i]] + worth[i]);
}
}
cout << dp[v];
return 0;
}
C++01背包
最新推荐文章于 2023-12-23 19:44:09 发布