Pagini recente » Cod sursa (job #827973) | Cod sursa (job #1411975) | Cod sursa (job #3143929) | Cod sursa (job #2789294) | Cod sursa (job #2427699)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream out("rucsac.out");
int n,i,j,dp[3][10001],g,w[5001],p[5001];
void mut()
{
for(int x=1;x<=g;x++)
dp[1][x]=dp[2][x];
}
int main()
{
f>>n>>g;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=g;j++)
{
if(j-w[i]>=0)
dp[2][j]=max(dp[1][j],dp[1][j-w[i]]+p[i]);
else
dp[2][j]=dp[1][j];
}
mut();
}
out<<dp[2][g];
return 0;
}