Cod sursa(job #820663)
| Utilizator | Data | 21 noiembrie 2012 09:00:52 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<cstdio>
#include<cstring>
int a[10001];
struct obiect
{
int g;
int p;
};
obiect v[5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,i,j,g,max;
scanf("%d%d",&n,&g);
for(i=1;i<=n;++i)
scanf("%d%d",&v[i].g,&v[i].p);
for(j=1;j<=g;++j)
a[j]=-1;
for(i=1;i<=n;++i)
for(j=g-v[i].g;j>=0;--j)
if(a[j]!=-1&&a[j]+v[i].p>a[j+v[i].g])
a[j+v[i].g]=a[j]+v[i].p;
max=0;
for(i=1;i<=g;++i)
if(a[i]>max)
max=a[i];
printf("%d",max);
return 0;
}
