Cod sursa(job #1377247)
Utilizator | Data | 5 martie 2015 20:54:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<cstdio>
#define NMAX 100000
using namespace std;
int Max, n, i, S;
int w[NMAX], p[NMAX], v[NMAX];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d%d",&n,&S);
for(int i = 1; i <= n; ++i)
scanf("%d%d",&w[i],&p[i]);
for(int i = 1; i <= n; ++i)
for(int j = S - w[i]; j >= 0 ; --j)
{
v[j + w[i]] = v[j] + p[i];
if (v[j + w[i]] > Max) Max = v[j + w[i]];
}
printf("%d\n",Max);
return 0;
}