Cod sursa(job #3188718)
Utilizator | Data | 3 ianuarie 2024 18:46:27 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, gr, p, dp[10005];
int main()
{
f >> n >> G;
while (n--) {
f >> gr >> p;
for (int j = G; j >= gr; --j) {
dp[j] = max(dp[j], dp[j - gr] + p);
}
}
g << dp[G];
return 0;
}