Pagini recente » Profil Ovidiu-Antonio | Cod sursa (job #3157549) | Cod sursa (job #603679) | Cod sursa (job #2757052) | Cod sursa (job #2150438)
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n,g,ma[5005][5005],cost[5005],val[5005];
int main()
{
int i,j;
in>>n>>g;
for(i=1;i<=n;i++)
in>>cost[i]>>val[i];
for(i=1;i<=n;i++)
for(j=1;j<=g;j++)
{
if(cost[i]<=j)
ma[i][j]=max(val[i]+ma[i-1][j-cost[i]],ma[i-1][j]);
else
ma[i][j]=ma[i-1][j];
}
out<<ma[n][g];
return 0;
}