Pagini recente » Cod sursa (job #895470) | Cod sursa (job #869708) | Cod sursa (job #650531) | Cod sursa (job #985628) | Cod sursa (job #2534594)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w[10010],p[10010],ruc[10010],maxg;
bool v[10010];
int main()
{
in>>n>>g;
v[0]=1;
for(int i=1;i<=n;++i)
in>>w[i]>>p[i];
for(int i=1;i<=n;++i)
{
for(int j=g-w[i];j>=0;--j)
{
if(v[j]==1)
{
v[j+w[i]]=1;
if(ruc[j]+p[i]>ruc[j+w[i]])
ruc[j+w[i]]=ruc[j]+p[i];
}
}
}
for(int i=1;i<=g;++i)
if(ruc[i]>maxg)
maxg=ruc[i];
out<<maxg;
return 0;
}