Pagini recente » Cod sursa (job #224889) | Cod sursa (job #2710046) | Cod sursa (job #278777) | Cod sursa (job #2558862) | Cod sursa (job #2818683)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int dp[5005],w[5005],p[5005];
int main()
{
int gmax,n;
in>>n>>gmax;
for(int i=1;i<=n;i++)
{
in>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int g=gmax;g>=0;g--)
{
if(g-w[i]>=0)
{
dp[g]=max(dp[g-w[i]]+p[i],dp[g]);
}
}
}
out<<dp[gmax];
return 0;
}