Pagini recente » Cod sursa (job #1773848) | Cod sursa (job #483763) | Cod sursa (job #525873) | Cod sursa (job #1125826) | Cod sursa (job #2645751)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[5005];
int main()
{
int n,GMAX,i,j,last,p,g,pmax;
fin>>n>>GMAX;
d[0]=0;
for(i=1;i<=GMAX;i++)
d[i]=-1;
last=0;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=last;j>=0;j--)
{
if(j+g>GMAX)
continue;
if(d[j]!=1)
{
if(d[j+g]<d[j]+p)
{
d[j+g]=d[j]+p;
if(j+g>last)
last=j+g;
}
}
}
}
pmax=d[1];
for(i=1;i<=GMAX;i++)
if(d[i]>pmax)
pmax=d[i];
fout<<pmax;
return 0;
}