Cod sursa(job #1981067)
Utilizator | Data | 14 mai 2017 18:36:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,m,d[10005],i,j,maxim,g,p;
int main(){
in >> n >> m;
for( i = 1; i <= n; i ++ ){
in >> g >> p;
for( j = m; j >= g; j -- ){
d[j] = max( d[j] , d[j-g] + p );
maxim = max(d[j],maxim);
}
}
out<<maxim;
return 0;
}