Cod sursa(job #2437020)
Utilizator | Data | 8 iulie 2019 08:43:49 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int dp[10001], v[5001], we[5001], n, G, i, j;
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
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];
return 0;
}