Cod sursa(job #1331340)
Utilizator | Data | 31 ianuarie 2015 15:46:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int n, G, i, xg, xp, x[10003], gmax, sol;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main(){
in>>n>>G;
for(;n--;){
in>>xg>>xp;
for(i=gmax; i>=0; i--){
if(i+xg<=G && xp+x[i]>x[i+xg])
x[i+xg]=xp+x[i];
if(i+xg>gmax && i+xg<G)
gmax=i+xg;
if(x[i+xg]>sol)
sol=x[i+xg];
}
}
out<<sol;
return 0;
}