Pagini recente » Cod sursa (job #1269014) | Cod sursa (job #2470851) | Cod sursa (job #1117239) | Cod sursa (job #3032034) | Cod sursa (job #2133379)
#include <fstream>
using namespace std;
int a[5001], v[5001], cmax[10001], n, b[10001],gmax;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int i,j,g,k;
fin>>n>>gmax;
for(i=1; i<=n; i++)
fin>>a[i]>>v[i];
for(j=1;j<=gmax;j++)
{
cmax[j]=-1;
b[j]=n+1;
}
for ( i=1;i<=n;++i)
for (g=0;g+a[i]<=gmax;g++)
if(b[g]<i && cmax[g+a[i]]<cmax[g]+v[i])
{
cmax[g+a[i]]=cmax[g]+v[i];
b[g+a[i]]=i;
}
g=gmax;
while(b[g]==n+1)
g--;
fout<<cmax[g];
return 0;
}