Pagini recente » Cod sursa (job #2507064) | Cod sursa (job #1581939) | Cod sursa (job #2295894) | Cod sursa (job #2474630) | Cod sursa (job #2138801)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,m,maxx;
int ans[2][10001];
int main()
{
in>>n>>g;
for(int i = 1;i<=n;i++)
{
int w,p;
in>>w>>p;
for(int j = 0;j<=g-w;j++)
{
if(ans[(i+1)%2][j+w]!=0)
ans[i%2][j+w]=max(ans[(i+1)%2][j+w],ans[(i+1)%2][j]+p);
else if(ans[(i+1)%2][j]!=0 || j==0)
ans[i%2][j+w]=ans[(i+1)%2][j]+p;
}
}
for(int i = 0;i<=g;i++)
if(ans[n%2][i]>maxx)
maxx=ans[n%2][i];
out<<maxx;
return 0;
}