Pagini recente » Cod sursa (job #542544) | Cod sursa (job #1762375) | Cod sursa (job #2346110) | Cod sursa (job #157397) | Cod sursa (job #2216218)
#include <stdio.h>
#include <algorithm>
using namespace std;
#define NMAX 1000
#define Gmax 10000
int g[NMAX + 5],v[NMAX + 5];
int dp[NMAX + 5][Gmax + 5];
int main()
{
//freopen("date.in", "r", stdin);
int n,gmax;
scanf("%d%d", &n, &gmax);
for (int i = 1; i <= n; i++)
scanf("%d%d", &g[i], &v[i]);
for (int i = 1; i <= n; i++)
{
for (int w = 0; w <= gmax; w++)
{
dp[i][w] = dp[i - 1][w];
if (g[i] <= w)
if (dp[i][w] < dp[i - 1][w - g[i]] + v[i])
dp[i][w] = dp[i - 1][w - g[i]] + v[i];
}
}
printf("%d", dp[n][gmax]);
return 0;
}