Cod sursa(job #949561)
Utilizator | Data | 14 mai 2013 10:37:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int i,j,n,gmax,Max,s[10001],g[10001],p[10001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&gmax);
for (i=1; i<=n; i++)
{
scanf("%d %d",&g[i],&p[i]);
}
for(i=1; i<=n; i++)
{
for (j=gmax; j>=g[i]; j--)
if(s[j]<s[j-g[i]]+p[i])
s[j]=s[j-g[i]]+p[i];
}
for (i=1; i<=gmax; i++)
if(s[i]>Max) Max=s[i];
printf("%d",Max);
return 0;
}