Pagini recente » Cod sursa (job #3276333) | Cod sursa (job #1826998) | Cod sursa (job #1543817) | Cod sursa (job #2873393) | Cod sursa (job #2409635)
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n, g, p, w, dp[10137], mx;
int main()
{
in>>n>>g;
for (register int i=1; i<=n; ++i)
{
in>>w>>p;
for (register int j=g-w; j>=0; --j)
if (j==0 || dp[j])
dp[j+w]=max (dp[j]+p, dp[j+w]);
}
for (register int i=1; i<=g; ++i)
mx=max (mx, dp[i]);
out<<mx;
return 0;
}