Pagini recente » Cod sursa (job #3266308) | Cod sursa (job #560553) | Borderou de evaluare (job #1020766) | Cod sursa (job #799913) | Cod sursa (job #2941335)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[5001], p[5001], dp[2][10001];
int main()
{
int n, i, m=1, nr, g, j;
fin>>n>>g;
for(i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=g;j++)
{
if(j-w[i]>=0)
{
dp[m][j]=max(dp[1-m][j], dp[1-m][j-w[i]]+p[i]);
}
else
{
dp[m][j]=dp[1-m][j];
}
}
m=1-m;
}
nr=0;
for(i=0;i<=g;i++)
{
nr=max(nr, dp[1-m][i]);
}
fout<<nr;
}