Cod sursa(job #889693)
Utilizator | Data | 24 februarie 2013 17:40:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[10001],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;
}