Cod sursa(job #3343617)
| Utilizator | Data | 27 februarie 2026 20:42:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int N, G, w, p, dp[10001];
int main()
{
f >> N >> G;
for(int i = 1; i <= N; i++)
{
f >> w >> p;
for(int j = G; j >= w; j--)
dp[j] = max(dp[j], dp[j - w] + p);
}
g << dp[G];
f.close();
g.close();
return 0;
}
