Pagini recente » Cod sursa (job #2260015) | Cod sursa (job #1064899) | Cod sursa (job #1681128) | Cod sursa (job #191485) | Cod sursa (job #1922699)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[2][10001], w[5001], p[5001], n, g, pmax;
int main()
{
int i, j, l;
fin>>n>>g;
for(i=1; i<=n; i++)
fin>>w[i]>>p[i];
fin.close();
l=0;
for(i=1; i<=n; i++, l=1-l)
for(j=0; j<=g; j++)
{
dp[1-l][j]=dp[l][j];
if(w[i]<=j)
dp[1-l][j]=max(dp[1-l][j], dp[l][j-w[i]]+p[i]);
}
pmax=dp[l][g];
fout<<pmax<<'\n';
fout.close();
return 0;
}