Pagini recente » Cod sursa (job #1365438) | Cod sursa (job #993082) | Cod sursa (job #1728957) | Cod sursa (job #3225940) | Cod sursa (job #2971191)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
struct obj
{
int g , c;
}v[5001];
int n , G , p[10001],maxx;
int main()
{
fin >> n >> G;
for(int i = 1 ; i <= n ; i++)
fin >> v[i].g >> v[i].c;
for(int i=1;i<=G;i++)
p[i]=-1;
p[0]=0;
for(int i=1;i<=n;i++)
{
for(int j=G-v[i].g;j>=0;j--)
if(p[j]!=-1 && p[j]+v[i].c>p[j+v[i].g])
{
p[j+v[i].g]=p[j]+v[i].c;
if(maxx<p[j+v[i].g])
maxx=p[j+v[i].g];
}
}
fout<<maxx;
}