Cod sursa(job #1194242)
Utilizator | Data | 3 iunie 2014 10:59:04 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 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--)
v[j]=std::max(v[j], v[j-w]+p);
}
h<<v[g];
return 0;
}