Cod sursa(job #1355130)
Utilizator | Data | 22 februarie 2015 13:57:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.05 kb |
#include <cstdio>
#include <vector>
using namespace std;
int i,j,k,l,m,n,max1,x,y,g1,g[5000],v[5000],prins[5000][5000],gr[5000],vr[5000],hot,ruc,greutatea;
void rucsacfraier()
{
for(i=0;i<g1+1;i++)
{
max1=0;
for(k=1;k<n+1;k++)
if(i-g[k]>=0)
{
if(vr[i-g[k]]+v[k]>max1){ if(prins[i-g[k]][k]==0){max1=vr[i-g[k]]+v[k];
hot=k;
ruc=i-g[k];
greutatea=gr[i-g[k]]+g[k];
}
else {if(vr[i-g[k]]>max1) max1=vr[i-g[k]];ruc=i-g[k]; greutatea=gr[i-g[k]]+g[k];} }
if(vr[i-g[k]]+v[k]==max1){if(greutatea>gr[i-g[k]]+g[k])
if(prins[i-g[k]][k]==0){max1=vr[i-g[k]]+v[k];
hot=k;
ruc=i-g[k];
greutatea=gr[i-g[k]]+g[k];
}
else {if(vr[i-g[k]]>max1) max1=vr[i-g[k]];ruc=i-g[k]; greutatea=gr[i-g[k]]+g[k];} }
}
for(j=1;j<n+1;j++)
prins[i][j]=prins[ruc][j];
if(hot!=0)
prins[i][hot]=1;
vr[i]=max1;
gr[i]=gr[ruc]+g[hot];
hot=0;
greutatea=0;
}
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&g1);
for(i=1;i<n+1;i++)
scanf("%d %d",&g[i],&v[i]);
rucsacfraier();
printf("%d",vr[g1]);
return 0;
}