Pagini recente » Cod sursa (job #1962747) | Cod sursa (job #3130140) | Cod sursa (job #502608) | Cod sursa (job #21379) | Cod sursa (job #1645005)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,q,pmax,i,cw;
int w[5010],p[5010];
int d[2][10010];
int main()
{
f>>n>>q;
for(i=1;i<=n;i++)
{
f>>w[i]>>p[i];
}
int l=0;
for(i=1;i<=n;i++,l=1-l)
{
for(cw=0;cw<=q;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][q];
g<<pmax;
return 0;
}