Pagini recente » Cod sursa (job #631857) | Cod sursa (job #1979599) | Cod sursa (job #2570115) | Cod sursa (job #1164329) | Cod sursa (job #3267660)
#include <iostream>
#include <fstream>
using namespace std;
//Variabile var 1
//int castig[10001], alege[10001], gr[10001], c[10001], i, j, n, g;
//Variabile var 2
int castig[10001][10001], alege[10001][10001], gr[10001], c[10001], i, j, n, g, obj;
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
/* Varianta 1
in >> n >> g;
for (int i = 1; i <= n; i++)
{
in >> gr[i] >> c[i];
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= g; j++)
{
if (gr[i] <= j)
{
if (c[i] + castig[j - gr[i]] > castig[j])
{
castig[j] = c[i] + castig[j - gr[i]];
alege[j] = i;
}
}
}
}
j = g;
out << castig[g] << endl;
//for (int k = 1; k <= n; k++) out << castig[k] << " ";
out << endl;
while (alege[j])
{
out << "produsul " << alege[j] << " greutate " << gr[alege[j]] << " castig " << c[alege[j]] << endl;
j -= gr[alege[j]];
}//*/
//* Varianta 2 -> prea multa memorie necesara
in >> n >> g;
for (int i = 1; i <= n; i++)
{
in >> gr[i] >> c[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= g; j++)
{
if (gr[i] <= j)
{
if (c[i] + castig[i - 1][j - gr[i]] > castig[i - 1][j])
{
castig[i][j] = c[i] + castig[i - 1][j - gr[i]];
alege[i][j] = i;
}
else
{
castig[i][j] = castig[i - 1][j];
alege[i][j] = alege[i - 1][j];
}
}
else
{
castig[i][j] = castig[i - 1][j];
alege[i][j] = alege[i - 1][j];
}
}
}
i = n; j = g;
out << castig[n][g] << endl;
/*while (alege[i][j])
{
obj = alege[i][j];
out << "produsul " << alege[i][j] << " greutate " << gr[alege[i][j]] << " castig " << c[alege[i][j]] << endl;
while (obj == alege[i][j])
{
j -= alege[i][j];
i--;
}
}*///*/
return 0;
}