Pagini recente » Cod sursa (job #2409545) | Cod sursa (job #2348705) | Cod sursa (job #1897313) | Cod sursa (job #2645237) | Cod sursa (job #1185851)
#include <cstdio>
#include <algorithm>
#define MAX 10005
#define MAXc 5005
using namespace std;
int d[MAX];
struct obiect{
int w,p;
};obiect coins[MAXc];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,g;
scanf("%d%d",&n,&g);
for(int i=1;i<=n;i++)
scanf("%d%d",&coins[i].w,&coins[i].p);
d[0]=1;
for(int i=1;i<=n;i++)
for(int j=g;j>=0;j--)
if(d[j] and (j+coins[i].w)<=g)
d[j+coins[i].w]=max(d[j],d[j]+coins[i].p);
printf("%d",d[g]-1);
return 0;
}