Pagini recente » Cod sursa (job #1864248) | Cod sursa (job #2407437) | Cod sursa (job #1554296) | Cod sursa (job #1396325) | Cod sursa (job #1499415)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int i,j,k,G,N,b[2][10005];
struct marfa{
int g,p;
};
marfa a[5005];
int main()
{
fin>>N>>G;
for(i=1;i<=N;i++)
{
fin>>a[i].g>>a[i].p;
}
for(i=0;i<=N;i++)
{
for(j=1;j<=G;j++)
{
b[1][j]=b[0][j];
if(a[i].g<=j)
{
b[1][j]=max(b[1][j],b[0][j-a[i].g]+a[i].p);
}
}
for(k=1;k<=G;k++){b[0][k]=b[1][k];}
}
fout<<b[1][G]<<"\n";
}