Cod sursa(job #2415884)
Utilizator | Data | 26 aprilie 2019 16:26:36 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 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; j >= w[i]; --j)
pd[j] = max(pd[j], p[i] + pd[j - w[i]]);
g << pd[G];
f.close();
g.close();
return 0;
}