Pagini recente » Cod sursa (job #2565412) | Cod sursa (job #2615916) | Cod sursa (job #1193555) | Cod sursa (job #2223178) | Cod sursa (job #1462841)
#include <fstream>
using namespace std;
int d[100001];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,g,p,P=0,i,j;
fin>>n>>G;
for(i=1;i<=n;i++)
{
d[i]=-1;
}
int smax=0;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=smax;j>=0;j--)
{
if(d[j]!=-1 && j+g<=G)
{
if(d[j+g]<d[j]+p)
{
d[j+g]=d[j]+p;
}
if(j+g>smax)
{
smax=j+g;
}
}
}
}
for(i=G;i>=1;i--)
{
if(d[i]>P)
{
P=d[i];
}
}
fout<<P;
return 0;
}