Cod sursa(job #2132956)

Utilizator biancaiulia5Bianca Badoi biancaiulia5 Data 16 februarie 2018 12:17:26
Problema Problema rucsacului Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>

using namespace std;
int i,n,W[10004],P[10002],a[2][5010],g,j;
int main()
{
    ifstream f("rucsac.in");
    ofstream g("rucsac.out");
   f>>n>>g;
    for(int i=1;i<=n;i++){
        f>>W[i]>>P[i];
    }

  for(i=1; i<=n; i++)
    {
        for(j=1; j<=g; j++)
        {
            a[1][j] = a[0][j];
            if (W[i] <= j)
                a[1][j] = max(a[0][j], a[0][j-W[i]] + P[i]);
        }
        for(j=1; j<=g; j++)
            a[0][j] = a[1][j];
    }
    g<<a[1][g];

    return 0;
}