Pagini recente » Cod sursa (job #1722683) | Cod sursa (job #3238740) | Cod sursa (job #3136974) | Cod sursa (job #89993) | Cod sursa (job #2920253)
#include <bits/stdc++.h>
using namespace std;
int dp[10001];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, gmax;
cin >> n >> gmax;
dp[0] = 1;
for(int i = 1; i <= n; i ++)
{
int g, p;
cin >> g >> p;
for(int j = gmax; j >= g; j --)
{
if(dp[j - g] != 0 and dp[j - g] + p > dp[j])
dp[j] = dp[j - g] + p;
}
}
int ans = INT_MIN;
for(int i = 1; i <= gmax; i ++)
{
ans = max(ans, dp[i]);
}
cout << ans;
return 0;
}