Cod sursa(job #3267892)

Utilizator andreimihaiu01@gmail.comMIHAIU Andrei [email protected] Data 12 ianuarie 2025 19:54:01
Problema Problema rucsacului Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.94 kb
#include <iostream>
#include <fstream>
using namespace std;

//Variabile var 1
int W[5001], P[5001];
int Optim[10001];

//Variabile var 2
//int castig[10001], ales[10001], gr[10001], c[10001], i, j, n, g;

//Variabile var 3
//int castig[10001][10001], alege[10001][10001], gr[10001], c[10001], i, j, n, g, obj;

int main()
{
    ifstream in("tema2.in");
    ofstream out("tema2.out");

    int n, g;
    in >> n >> g;
    for (int i = 1; i <= n; ++i) {
        in >> W[i] >> P[i];
    }

    Optim[0] = 0;
    int sol = 0;

    for (int i = 1; i <= n; ++i)
        for (int j = g - W[i]; j >= 0; --j) {
            if (Optim[j + W[i]] < Optim[j] + P[i])
            {
                Optim[j + W[i]] = Optim[j] + P[i];
                if (Optim[j + W[i]] > sol)
                    sol = Optim[j + W[i]];
            }
        }
    out << sol;
    /* Varianta 2 -> poate sa ia un obj de acelasi tip de nenumarate ori
    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]];
                    ales[j] = c[i];
                }

            }
            cout << gr[i] << " " << c[i] << " " << castig[j - gr[i]] << endl;
        }
    }
    j = g;
    out << castig[g] << endl;
    //for (int k = 1; k <= n; k++) out << castig[k] << " ";
    /*
    out << endl;
    while (ales[j])
    {
        out << "produsul " << ales[j] << " greutate " << gr[ales[j]] << " castig " << c[ales[j]] << endl;
        j -= gr[ales[j]];
    }//*///*/

    /* Varianta 3 -> 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;
}