Cod sursa(job #3041765)

Utilizator razviOKPopan Razvan Calin razviOK Data 1 aprilie 2023 14:45:08
Problema Problema rucsacului Scor 0
Compilator c-64 Status done
Runda Arhiva educationala Marime 1.73 kb
#include <stdio.h>
#include <stdlib.h>

int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);

    int n=0,W=0;

    scanf("%d",&n);
    scanf("%d",&W);

    int *w=(int *)malloc(sizeof(int)*n);
    int *v=(int *)malloc(sizeof(int)*n);

    for(int i=0; i<n; i++)
        scanf("%d %d",&w[i],&v[i]);


    int **sol_value=(int **)malloc(sizeof(int *)*2);
    int **sol_weight=(int **)malloc(sizeof(int *)*2);

    sol_value[0]=(int *)malloc(sizeof(int)*(W+1));
    sol_weight[0]=(int *)malloc(sizeof(int)*(W+1));

    sol_value[1]=(int *)malloc(sizeof(int)*(W+1));
    sol_weight[1]=(int *)malloc(sizeof(int)*(W+1));

    for(int i=0; i<n; i++)
        for(int j=0; j<=W; j++)
        {
            if(j<w[i])
            {
                sol_value[(i+1)%2][j]=0;
                sol_weight[(i+1)%2][j]=0;
            }
            else
            {
                if(i==0)
                {
                    sol_value[(i+1)%2][j]=v[i];
                    sol_weight[(i+1)%2][j]=w[i];
                }
                else
                {
                    if(sol_value[i%2][j]>sol_value[i%2][j-w[i]]+v[i])
                    {
                        sol_value[(i+1)%2][j]=sol_value[i%2][j];
                        sol_weight[(i+1)%2][j]=sol_weight[i%2][j];
                    }
                    else
                    {
                        sol_value[(i+1)%2][j]=sol_value[i%2][j-w[i]]+v[i];
                        sol_weight[(i+1)%2][j]=sol_weight[i%2][j-w[i]]+w[i];
                    }
                }
            }

        }

    printf("%d",sol_value[n%2][W]);
   // printf("%d  %d",sol_weight[n%2][W],sol_value[n%2][W]);

    return 0;
}