Pagini recente » Cod sursa (job #2767544) | Cod sursa (job #2101917) | Cod sursa (job #2613298) | Cod sursa (job #260751) | Cod sursa (job #2493050)
#include <fstream>
#define NMAX 5005
#define GMAX 10005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N, G;
int mxProfit[5][GMAX];
int weight[NMAX], profit[NMAX];
int main()
{
fin >> N >> G;
for (int i = 1; i <= N; i++)
fin >> weight[i] >> profit[i];
for (int i = 1; i <= N; i++)
for (int j = 0; j <= G; j++)
{
mxProfit[i % 2][j] = max(mxProfit[1 - i % 2][j], mxProfit[i % 2][j - 1]);
if (j >= weight[i])
mxProfit[i % 2][j] = max(mxProfit[i % 2][j], mxProfit[1 - i % 2][j - weight[i]] + profit[i]);
}
fout << mxProfit[N % 2][G];
return 0;
}