Cod sursa(job #3280048)
Utilizator | Data | 25 februarie 2025 11:44:51 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, w[5001], p[5001], dp[10001];
int main()
{
fin>>n>>g;
for (int i=1; i<=n; i++)
{
fin>>w[i]>>p[i];
}
for (int i=1; i<=n; i++)
{
for (int cw=G; cw>=w[i]; cw--)
{
dp[cw]=max(dp[cw], dp[cw-w[i]]+p[i]);
}
}
fout<<dp[g]
return 0;
}