Cod sursa(job #1374136)
| Utilizator | Data | 4 martie 2015 23:17:26 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
#include <algorithm>
int main()
{
std::ifstream fin{"rucsac.in"};
std::ofstream fout{"rucsac.out"};
int N, G;
fin >> N >> G;
std::vector<std::pair<int, int>> R(N);
for (auto &i : R)
fin >> i.first >> i.second;
std::vector<int> D(G + 1, 0);
for_each(R.cbegin(),
R.cend(),
[&D, G](const decltype(R)::value_type& v) {
for (auto j = G; j >= 1; --j)
if (v.first <= j)
D[j] = std::max(D[j], D[j - v.first] + v.second);
});
fout << D[G];
return 0;
}
