Pagini recente » Cod sursa (job #1162926) | Cod sursa (job #948361) | Cod sursa (job #601184) | Cod sursa (job #2478003) | Cod sursa (job #1686220)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int m[2][10005], i, j, n, G, w[5005], p[5005], pmax;
int main()
{ f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{ for(j=1;j<=G;j++)
if(w[i]<=j)
m[i%2][j]=max(m[!(i%2)][j],m[!(i%2)][j-w[i]]+p[i]);
else m[i%2][j]=m[!(i%2)][j];
pmax=max(pmax,m[i%2][G]);
}
g<<pmax;
return 0;
}