Cod sursa(job #1194239)
Utilizator | Data | 3 iunie 2014 10:55:34 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
int v[10001], n, g;
int main()
{
int i, p, w, j;
std::ifstream f("rucsac.in");
std::ofstream h("rucsac.out");
f>>n>>g;
for(i=1; i<=n; i++){
f>>w>>p;
for(j=g; j>=w; j--)
if(v[j]<v[j-w]+p)
v[j] = v[j-w] + p;
}
h<<v[g];
return 0;
}