Pagini recente » Cod sursa (job #2568473) | Cod sursa (job #2790835) | Cod sursa (job #2052375) | Cod sursa (job #2946962) | Cod sursa (job #1912593)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,gmax,dp[2][10005],w[5005],p[5005];
int main()
{
int i,j;
fin>>n>>gmax;
for(i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
int l=0;
for(int i=1; i<=n; ++i, l=1-l)
{
for(int j=0; j<=gmax; ++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]);
}
}
}
fout<<dp[l][gmax];
fin.close();
fout.close();
return 0;
}