Pagini recente » Cod sursa (job #33320) | Cod sursa (job #2821334) | Cod sursa (job #2507244) | Cod sursa (job #1871927) | Cod sursa (job #1811373)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout("rucsac.out");
int w[5010], p[5010], n, g, cw, i, d[5][10010], t, x;
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++)
fin>>w[i]>>p[i];
t=1;
for(i=1;i<=n;i++){
for(cw=0;cw<=g;cw++){
x=abs(t-1);
d[t][cw]=d[x][cw];
if(w[i]<=cw)
d[t][cw]=max(d[x][cw], d[x][cw-w[i]]+p[i]);
}
t=abs(t-1);
}
t=abs(t-1);
fout<<d[t][g];
return 0;
}