Pagini recente » Cod sursa (job #2541476) | Cod sursa (job #2435657) | Cod sursa (job #1259586) | Cod sursa (job #1486372) | Cod sursa (job #2080521)
#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 5001
#define GMAX 10001
#define weight first
#define profit second
#define UNDEF -1
using namespace std;
pair<int, int> objs[NMAX];
int **dp, n, G;
void read() {
int x, y;
ifstream in("rucsac.in");
in >> n >> G;
for (int i = 1; i <= n; i++) {
in >> x >> y;
objs[i] = make_pair(x, y);
}
in.close();
}
int main()
{
read();
dp = new int* [NMAX];
dp[0] = new int[GMAX];
memset(dp[0], 0, sizeof(int) * GMAX);
for (int i = 1; i <= n; i++) {
dp[i] = new int[GMAX];
memset(dp[i], 0, sizeof(int) * GMAX);
for (int j = 1; j <= G; j++) {
if (objs[i].weight > j)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - objs[i].weight] + objs[i].profit);
}
delete dp[i - 1];
}
ofstream out("rucsac.out");
out << dp[n][G] << "\n";
out.close();
delete dp[n];
delete dp;
return 0;
}