Pagini recente » Cod sursa (job #2874321) | Cod sursa (job #2534723) | Cod sursa (job #3180515) | Cod sursa (job #260950) | Cod sursa (job #1843439)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int Nmax=5000+5,Gmax=10000+5;
int N,G;
int W[Nmax],P[Nmax],Optim[Nmax];
int main()
{
int sol=0;
fin>>N>>G;
for(int i=1;i<=N;++i)fin>>W[i]>>P[i];
for(int i=1;i<=N;++i)
{
for(int j=G-W[i];j>=0;--j)
{
if(Optim[j+W[i]]<Optim[j]+P[i])
{
Optim[j+W[i]]=Optim[j]+P[i];
if(Optim[j+W[i]]>sol)
sol=Optim[j+W[i]];
}
}
}
fout<<sol;
return 0;
}