Pagini recente » Cod sursa (job #2109504) | Cod sursa (job #1827836) | Cod sursa (job #2793848) | Cod sursa (job #663036) | Cod sursa (job #2202794)
#include <bits/stdc++.h>
using namespace std;
int n,g;
int profit[5005];
int greutate[5005];
int mx_profit[10005];
bitset<10005>ap;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d\n",&n,&g);
for(int i=1;i<=n;i++)
scanf("%d %d\n",&greutate[i],&profit[i]);
ap[0]=1;
for(int i=1;i<=n;i++)
{
for(int j=g;j>=1;j--)
{
if(greutate[i]>j || ap[j-greutate[i]]==0)
continue;
ap[j]=1;
mx_profit[j]=max(mx_profit[j],profit[i]+mx_profit[j-greutate[i]]);
}
}
printf("%d",mx_profit[g]);
return 0;
}