Cod sursa(job #731734)
| Utilizator | Data | 9 aprilie 2012 00:03:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int mat[10010][5010];
int main()
{
int n,g,i,j,w[5010],p[5010];
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&g);
for(i=1;i<=n;i++)
{
scanf("%d %d",&w[i],&p[i]);
}
for(i=1;i<=g;i++)
{
for(j=1;j<=n;j++)
{
if(w[j]<=i)
{
mat[i][j]=max(mat[i][j-1],mat[i-w[j]][j-1]+p[j]);
}
else mat[i][j]=mat[i][j-1];
}
}
printf("%d",mat[g][n]);
return 0;
}
