Pagini recente » Cod sursa (job #1580388) | Cod sursa (job #492636) | Cod sursa (job #40774) | Cod sursa (job #3178333) | Cod sursa (job #1430421)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[10002],p[5002],w[5002];
int main()
{
int n,s,maxim;
fin>>n>>s;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
d[0]=1;
for(int i=1;i<=n;i++)
{
for(int j=s;j>=0;j--)
{
if(d[j]>=1&&(j+w[i])<=s)
{
d[j+w[i]]=max(d[j+w[i]],p[i]+d[j]);
}
}
}
maxim=0;
for(int i=0;i<=s;i++)
{
if(d[i]>maxim)
maxim=d[i];
}
fout<<maxim-1<<"\n";
return 0;
}