Cod sursa(job #2854526)
| Utilizator | Data | 21 februarie 2022 14:41:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
short W[5005], P[5005];
int dp[5005][10005];
int main()
{
std::ifstream f("rucsac.in");
std::ofstream g("rucsac.out");
int N, G;
f >> N >> G;
for (int i = 0; i < N; ++i)
f >> W[i] >> P[i];
for (int i = 0; i < N; ++i)
dp[i][0] = 0;
for (int i = 0; i < G; ++i)
dp[0][i] = 0;
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= G; ++j)
{
if (j - W[i - 1] >= 0)
dp[i][j] = std::max(dp[i - 1][j], dp[i - 1][j - W[i - 1]] + P[i - 1]);
else
dp[i][j] = dp[i - 1][j];
}
}
g << dp[N][G];
}