Pagini recente » Cod sursa (job #2662970) | Cod sursa (job #12209) | Cod sursa (job #1031908) | Cod sursa (job #101674) | Cod sursa (job #2497581)
#include <fstream>
#define NMax 5005
#define GMax 10005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N,G,W[NMax],P[NMax],DP[2][GMax],l=1;
void Read()
{
fin>>N>>G;
for(int i=1;i<=N;i++)
{
fin>>W[i]>>P[i];
}
}
void Solve()
{
for(int i=1;i<=N;i++,l=1-l)
for(int j=1;j<=G;j++)
{
DP[l][j]=DP[1-l][j];
if(j>=W[i])
DP[l][j]=max(DP[l][j],DP[1-l][j-W[i]]+P[i]);
}
}
void Print()
{
fout<<DP[1-l][G]<<'\n';
}
int main()
{
Read();
Solve();
Print();
return 0;
}