Cod sursa(job #3361620)
| Utilizator | Data | 26 iulie 2026 17:31:12 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n, g;
int dp[10005];
int ans = -1;
/// dp[j][i] = val max a primelor i obiecte cu greutatea j
int main()
{
in >> n >> g;
for (int i = 1; i <= n; i++)
{
int w, p;
in >> w >> p;
for (int j = g; j >= w; j--)
{
dp[j] = max(dp[j - w] + p, dp[j]);
}
}
out << dp[g];
return 0;
}
