Pagini recente » Cod sursa (job #2113507) | Cod sursa (job #2251475) | Cod sursa (job #2797759) | Cod sursa (job #2159497) | Cod sursa (job #1647143)
#include <bits/stdc++.h>
using namespace std;
int n , g , w , p , ans , i;
int dp[10000+10];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d", &n, &g);
for ( ; n ; --n)
{
scanf("%d %d", &w, &p);
for (i = g - w; i >= 0; --i)
dp[i+w] = max(dp[i+w] , dp[i] + p);
}
for (i = 0; i <= g; ++i) ans = max(ans , dp[i]);
printf("%d\n", ans);
return 0;
}