#include<iostream>
using namespace std;
#define N 50
int i, j,n, c,v[N], w[N], dp[N][10 * N], x[N] = { 0 };
void max() {
int cv;
j = c;
for (j = 0; j <= c; j++) {
if (j < w[n])
dp[n][j] = 0;
else
{
dp[n][j] = v[n];
}
}
for (i = n - 1; i >= 1; i--) {
for ( j = 0; j <= c; j++)
{
if (j >= w[i] && dp[i + 1][j] < dp[i + 1][j - w[i]] + v[i])
dp[i][j] = dp[i + 1][j - w[i]]+v[i];
else
{
dp[i][j] = dp[i + 1][j];
}
}
}
for (cv = 0, i = 1; i <= n - 1; i++) {
if (dp[i][j] != dp[i + 1][j]) {
x[i] = i;
j = j - w[i];
cv = cv + v[i];
}
}
if (dp[1][c] >= cv) {
x[n] = 1;
j = j - w[n];
}
cout << dp[1][c];
}
void main() {
cin >> n >> c;
for ( i = 1; i <= n; i++)
{
cin >> w[i] >> v[i];
}
max();
}
运行结果