Cod sursa(job #3039383)
| Utilizator | Data | 28 martie 2023 14:48:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
struct obiect {
int w, p;
} o[5005];
int n, g, dp[5005][10005];
int main()
{
in >> n >> g;
for (int i = 1; i <= n; i++) {
in >> o[i].w >> o[i].p;
}
for (int i = 1; i <= n; i++) {
for (int j = o[i].w; j <= g; j++)
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - o[i].w] + o[i].p);
}
out << dp[n][g];
return 0;
}
