Pagini recente » Cod sursa (job #2209200) | Cod sursa (job #2832998) | Cod sursa (job #1691301) | Cod sursa (job #2758920) | Cod sursa (job #2757159)
#include <fstream>
using namespace std;
const int NMAX=10000;
int d[NMAX+5];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n,i,j,w,p,maxp,G,last;
fin>>n>>G;
d[0]=0;
for(i=1;i<=G;i++)
d[i]=-1;
last=0;
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=last;j>=0;j--)
{
if(j+w>G)
continue;
if(d[j]!=-1)
{
if(d[j]+p>d[j+w])
d[j+w]=d[j]+p;
if(j+w>last)
last=j+w;
}
}
}
maxp=-1;
for(j=G;j>=1;j--)
if(d[j]>maxp)
maxp=d[j];
fout<<maxp<<"\n";
fin.close();
fout.close();
return 0;
}