Pagini recente » Cod sursa (job #122915) | Cod sursa (job #1184137) | Cod sursa (job #816825) | Cod sursa (job #1336683) | Cod sursa (job #1520505)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int maxim,N,G,w[50000],p[50001],sol[50001];
int main()
{
f>>N>>G;
for(int i=1;i<=N;++i)
f>>w[i]>>p[i];
for(int i=1;i<=N;++i)
for(int j=G-w[i];j>-1;--j)
if(sol[j+w[i]]<sol[j]+p[i])
{
j[sol+w[i]]=sol[j]+p[i];
if(sol[j+w[i]]>maxim)
maxim=sol[j+w[i]];
}
g<<maxim;
g.close();
return 0;
}