Pagini recente » Cod sursa (job #1549937) | Cod sursa (job #1393623) | Cod sursa (job #2909225) | Clasamentul arhivei de probleme | Cod sursa (job #2960877)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int Nmax = 5 * 1e3 + 1, Gmax = 1e4 + 1;
int dp[Nmax][Gmax];
int g[Nmax], p[Nmax];
int main()
{
int n, gr, i, j;
fin >> n >> gr;
for(i = 1; i <= n; i++)
fin >> g[i] >> p[i];
for(i = 1; i <= n; i++)
for(j = 1; j <= gr; j++)
if(j < g[i])
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - g[i]] + p[i]);
for(i = 1; i <= n; i++)
{
for(j = 0; j <= gr; j++)
fout << dp[i][j] << " ";
fout << '\n';
}
fout << dp[n][gr];
return 0;
}