Pagini recente » Cod sursa (job #726506) | Cod sursa (job #1121193) | Cod sursa (job #191996) | Cod sursa (job #1648756) | Cod sursa (job #3004687)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w[5001],p[5001],ans[10001];
int main()
{
fin >> n >> g;
for(int i=1;i<=n;i++)
{
fin >> w[i] >> p[i];
}
int sol=0;
for(int i=1;i<=n;i++)
{
for(int j=g-w[i];j>=0;j--)
{
if(ans[j+w[i]]<ans[j]+p[i])
{
ans[j+w[i]]=ans[j]+p[i];
sol=max(sol,ans[j+w[i]]);
}
}
}
fout << sol;
return 0;
}