Pagini recente » Cod sursa (job #560924) | Cod sursa (job #2335768) | Cod sursa (job #1246313) | Cod sursa (job #2956502) | Cod sursa (job #3130541)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,Pmax;
int W[5010],P[5010];
int D[2][10010];
int main()
{
f>>n>>G;
for(int i=1;i<=n;i++)
f>>W[i]>>P[i];
int l=0;
for(int i=1;i<=n;++i,l=1-l)
for(int cw=0;cw<=G;++cw)
{
D[1-l][cw]=D[l][cw];
if(W[i]<=cw)
D[1-l][cw] =max(D[1-l][cw],D[l][cw-W[i]]+P[i]);
}
Pmax=D[l][G];
g<<Pmax;
return 0;
}