Cod sursa(job #889688)
Utilizator | Data | 24 februarie 2013 17:39:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[5001], w, p, n, g;
int main(){
fin>>n>>g;
for ( int i=1;i<=n;i++ ){
fin>>w>>p;
for ( int j = g-w;j>=0;j-- )
d[j+w] = max(d[j+w],d[j]+p);
}
fout<<d[g];
return 0;
}