Pagini recente » Cod sursa (job #325143) | Cod sursa (job #325953) | Cod sursa (job #2586658) | Cod sursa (job #2558694) | Cod sursa (job #2700982)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[5007], p[5007];
int dp[10007];
int main()
{
int n, g;
fin >> n >> g;
for(int i = 1; i <= n; i++)
{
fin >> w[i] >> p[i];
}
int maxim = 0;
for(int i = 1; i <= n; i++)
{
for(int j = g - w[i]; j >= 0; j--)
{
dp[j + w[i]] = max(dp[j + w[i]], dp[j] + p[i]);
maxim = max(maxim, dp[j + w[i]]);
}
}
fout << maxim;
return 0;
}