Pagini recente » Cod sursa (job #134207) | Cod sursa (job #2655233) | Cod sursa (job #617784) | Cod sursa (job #2215919) | Cod sursa (job #2474316)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int best[10001];
int main()
{
int n,g,i,x,val,j;
in>>n>>g;
best[0]=0;
for(i=1;i<=g;i++)
best[i]=-2e9;
for(i=1;i<=n;i++)
{
in>>x>>val;
for(j=g-x;j>=0;j--)
best[j+x]=max(best[j]+val,best[j+x]);
}
for(i=1;i<=g;i++)
best[i]=max(best[i],best[i-1]);
out<<best[g];
return 0;
}