Pagini recente » Cod sursa (job #2913252) | Cod sursa (job #2413848) | Cod sursa (job #1428521) | Cod sursa (job #2141395) | Cod sursa (job #2615699)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int GMAX=100000;
int d[GMAX+5];
int main()
{
int n,i,j,last,g,G,GMAX,p,pmax=0;
fin>>n>>G;
d[0]=0;
last=0;
for(i=1; i<=G; i++)
d[i]=-1;
for(i=1; i<=n; i++)
{
fin>>g>>p;
for(j=last; j>=0; j--)
{
if(j+g>G)
continue;
if(d[j]!=-1)
if(d[j]+p>d[j+g])
{
d[j+g]=d[j]+p;
last=max(last, j+p);
}
}
}
for(j=G; j>=0; j--)
if(d[j]>pmax)
pmax=d[j];
fout<<pmax;
}