Mai intai trebuie sa te autentifici.
Cod sursa(job #1331494)
Utilizator | Data | 31 ianuarie 2015 18:47:35 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<cstdio>
#define NMAX 100000
using namespace std;
int g[NMAX],p[NMAX],v[NMAX];
int Max,n,i,m;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;++i) scanf("%d%d",&g[i],&p[i]);
for (i=1;i<=n;++i)
for (int j=m-g[i];j>=0;--j)
if (v[j+g[i]]<v[j]+p[i])
{
v[j+g[i]]=v[j]+p[i];
if (v[j+g[i]]>Max) Max=v[j+g[i]];
}
printf("%d\n",Max);
return 0;
}