Cod sursa(job #2431022)
| Utilizator | Data | 17 iunie 2019 18:08:18 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#define NMAX 5010
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, w[NMAX],p[NMAX],pd[10010],G;
int main()
{
f >> n >> G;
for(int i = 1; i <= n; ++i)
f >> w[i] >> p[i];
for(int i = 1; i <= n; ++i)
for(int j = G - w[i]; j >= 0; --j)
pd[j + w[i]] = max(pd[j + w[i]], p[i] + pd[j]);
g << pd[G];
return 0;
}
