Cod sursa(job #2559137)
| Utilizator | Data | 27 februarie 2020 07:29:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int dp[10001], we[501], v[501], n, i, j, G;
int main()
{
f >> n >> G;
for(i = 1; i <= n; ++ i)
f >> we[i] >> v[i];
for(i = 1; i <= n; ++ i)
for(j = G; j >= we[i]; j --)
dp[j] = max(dp[j], dp[j - we[i]] + v[i]);
g << dp[G];
f.close();
g.close();
return 0;
}
