Pagini recente » Cod sursa (job #1737136) | Cod sursa (job #1761846) | Cod sursa (job #2476887) | Cod sursa (job #727096) | Cod sursa (job #2016626)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int a[5001],n,m,s[100001],c[5001],i,j,maxim;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>a[i]>>c[i];
}
for(i=1;i<=n;i++)
{
for(j=m;j>=0;j--)
{
if(j-a[i]==0)
{
if(c[i]>s[j])
{
s[j]=c[i];
}
}
else
{
if(j-a[i]>0 && s[j-a[i]]!=0 && s[j-a[i]]+c[i]>s[j])
{
s[j]=s[j-a[i]]+c[i];
}
}
if(s[j]>maxim)
{
maxim=s[j];
}
}
}
g<<maxim;
return 0;
}