Cod sursa(job #664119)
| Utilizator | Data | 19 ianuarie 2012 17:40:16 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<cstdio>
int N,G,a[10005],i,j,w,p;
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d%d", &N, &G); a[0]=1;
for(i=1;i<=N;i++)
{
scanf("%d%d", &w, &p);
for (j=G-w;j>=0;j--)
{
if (a[j]+p>a[j+w])
a[j+w]=a[j]+p;
}
}
for(i=0;i<=G;i++)
{
if(a[i]>p)
p=a[i];
}
printf("%d", p-1);
return 0;
}
