Cod sursa(job #3364563)
| Utilizator | Data | 5 septembrie 2026 15:49:28 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,W,g[5005],w[5005],dp[5005];
int main()
{
fin>>n>>W;
for(int i=1;i<=n;i++)
{
fin>>g[i]>>v[i];
}
for (int i = 1; i <= n; i++) {
for (int w = W; w >= g[i]; w--) {
dp[w] = max(dp[w], dp[w - g[i]] + v[i]);
}
}
fout<<dp[W];
return 0;
}
