Pagini recente » Cod sursa (job #453535) | Cod sursa (job #158770) | Monitorul de evaluare | Cod sursa (job #3136328) | Cod sursa (job #1938102)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,w[5002],p[5002],d[3][10003],sol;
int main()
{
f>>n>>G;
for(int i=1;i<=n;++i)
{
f>>w[i]>>p[i];
}
for(int i=1;i<=n;++i)
{
for(int j=0;j<=G;++j)
{
d[2][j]=d[1][j];
if(w[i]<=j)
{
d[2][j]=max(d[2][j],d[1][j-w[i]]+p[i]);
}
}
for(int j=0;j<=G;++j)
{
d[1][j]=d[2][j];
}
}
g<<d[2][G];
return 0;
}