Pagini recente » Cod sursa (job #817662) | Cod sursa (job #2464596) | Cod sursa (job #1095577) | Cod sursa (job #647493) | Cod sursa (job #2342055)
#include <fstream>
#include <cstring>
constexpr int MAX_G = 10001;
int profit[MAX_G];
int main() {
int n, G, i , j, p, g;
std::ifstream in("rucsac.in");
std::ofstream out("rucsac.out");
in >> n >> G;
for (i = 0; i < n; ++i) {
in >> g >> p;
for (j = G - g; j >= 0; --j) if (p + profit[j] > profit[j + g]) profit[j + g] = p + profit[j];
}
out << profit[G];
return 0;
}