Pagini recente » Cod sursa (job #2519514) | Cod sursa (job #2228624) | Cod sursa (job #1889616) | Cod sursa (job #3185529) | Cod sursa (job #1769316)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f1("rucsac.in");
ofstream f2("rucsac.out");
int DP[2][10005],p[5005],w[5005],i,j,n,g;
int main()
{
f1>>n>>g;
for(i=1;i<=n;++i){
f1>>w[i]>>p[i];
}
for(i=1;i<=n;++i){
for(j=1;j<=g;++j){
DP[1][j]=DP[0][j];
if(j-w[i]>=0){
DP[1][j]=max(DP[0][j],DP[0][j-w[i]]+p[i]);
}
}
for(j=1;j<=g;++j){
DP[0][j]=DP[1][j];
}
}
f2<<DP[0][g]<<'\n';
return 0;
}