Pagini recente » Cod sursa (job #2233522) | Cod sursa (job #2979218) | Cod sursa (job #2423144) | Cod sursa (job #3270622) | Cod sursa (job #1375753)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("greedy.in");
ofstream h("rucsac.out");
long g,c,x[20000],z[20000],n,r,v,i,max=0;
f>>n>>r;
for(i=1;i<=2*r;i++)
{x[i]=0;
z[i]=0;
}
for(i=1;i<=n;i++)
{
f>>g>>c;
if(x[g]<c)
x[g]=c;
for(v=0;v<=r;v++)
{
if(z[v]!=0)
if((z[v]+c>x[g+v])&&(g+v<=r))
x[g+v]=z[v]+c;
}
for(v=1;v<=r;v++)
{
z[v]=x[v] ;
// h<<z[v]<<" ";
}
//h<<"\n";
}
for(int i=1;i<=r;i++)
if(max<z[i])
max=z[i];
h<<max;
}