Pagini recente » Cod sursa (job #2322205) | Cod sursa (job #536867) | Cod sursa (job #969240) | Cod sursa (job #868324) | Cod sursa (job #2048236)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream fo ("rucsac.out");
int w[5001],p[5001],d[2][10001];
int g,n;
void calcul()
{
int l=0,pmax=0;
for(int i=1;i<=n;i++)
{
l=1-l;
for(int j=0;j<=g;j++)
{
d[l-1][j]=d[l][j];
if(w[i]<=j)
d[1-l][j]=max(d[1-l][j],d[l][j-w[i]]+p[i]);
}
}
fo<<d[1-l][g];
}
int main()
{
f>>n>>g;
for(int i=1;i<n;i++)
f>>w[i]>>p[i];
calcul();
return 0;
}