Cod sursa(job #2078999)
Utilizator | Data | 30 noiembrie 2017 13:26:57 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, pd[10005];
int main()
{
in >> n >> g;
for(int p, w, i = 1; i <= n; ++i)
{
in >> w >> p;
for(int j = g-w; j >= 0; --j)
{
if(pd[j+w] < pd[j] + p)
pd[j+w] = pd[j] + p;
}
}
out << pd[g] << '\n';
in.close(), out.close();
return 0;
}