Cod sursa(job #1273120)
| Utilizator | Data | 22 noiembrie 2014 14:54:02 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <vector>
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 (auto i = 0u; i < R.size() - 1; ++i)
for (auto j = G; j >= 1; --j)
if (R[i].first <= j)
D[j] = std::max(D[j], D[j - R[i].first] + R[i].second);
fout << std::max(D[G], D[G - R.back().first] + R.back().second);
return 0;
}
