Pagini recente » Cod sursa (job #1125257) | Cod sursa (job #1997211) | Cod sursa (job #161315) | Cod sursa (job #974618) | Cod sursa (job #1098266)
#include <fstream>
using namespace std;
int d[10001];
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,gi,p,i,j,pmax = 0;
in>>n>>g;
for(i=1;i<=g;i++) d[i]=-1;
for(i=1;i<=n;i++)
{
in>>gi>>p;
for(j=g-gi;j>=0;j--)
{
if(d[j]>=0)
{
if(d[j+gi]<d[j]+p)
{
d[j+gi]=d[j]+p;
if( d[j+gi] > pmax)
pmax = d[j+gi];
}
}
}
}
out<<pmax;
return 0;
}