Pagini recente » Cod sursa (job #2322441) | Cod sursa (job #242695) | Cod sursa (job #597350) | Cod sursa (job #2888145) | Cod sursa (job #819513)
Cod sursa(job #819513)
#include<fstream>
using namespace std;
int main(){
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[10000], w[5000], p[5000], i, j, n, g;
fin >> n >> g;
for(i=0; i<n; i++) fin >> w[i] >> p[i];
d[0] = 0;
for(i=1; i<=g; i++) d[i] = -1;
for(i=0; i<n; i++)
for(j=g; j>=w[i]; j--){
if(d[j - w[i]]!= -1 && d[j-w[i]]+p[i] > d[j]) d[j] = d[j-w[i]]+ p[i];
}
fout << d[g];
return 0;
}