Pagini recente » Cod sursa (job #713625) | Cod sursa (job #275742) | Cod sursa (job #2046297) | Cod sursa (job #2058096) | Cod sursa (job #2331517)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int f[10005],x,y,n,m,i,j,k,smax,last=0;
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
f[i]=-1;
f[0]=0;
for(i=1;i<=n;i++)
{
fin>>x>>y;
for(j=last;j>=0;j--)
{
if(j+x>m)
continue;
if(f[j]!=-1)
{
if(f[j+x]<f[j]+y)
{
f[j+x]=f[j]+y;
}
if(j+x>last)
last=j+x;
}
}
}
for(i=m;i>=1;i--)
{
if(f[i]>k)
k=f[i];
}
fout<<k;
return 0;
}