Pagini recente » Cod sursa (job #2801948) | Cod sursa (job #2202014) | Cod sursa (job #2500463) | Cod sursa (job #2301073) | Cod sursa (job #2758697)
#include <fstream>
#include <cmath>
using namespace std;
int n,g,pmax;
int w[5005],p[5005],dp[10005];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
//dp[i][j]=dp[i][j-w[i]]+p[i];
int linie_curent,linie_anterior;
for(int i=1;i<=n;i++)
{
for(int j=g;j>=0;j--)
{
if(j-w[i]>=0)
dp[j]=max(dp[j-w[i]]+p[i],dp[j]);
}
}
fout<<dp[g];
return 0;
}