Cod sursa(job #1997727)

Utilizator Y0da1NUME JMECHER Y0da1 Data 5 iulie 2017 11:24:54
Problema Problema rucsacului Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n, g, Pmax;
int P[5010], G[5010];
int D[5010][10010];
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int main()
{
    int i,j;
    in>>n>>g;
    for(i=1;i<=n;i++)
        in>>G[i]>>P[i];
    //dinamica
    for(i=1;i<=n;i++)
        for(j=1;j<=g;++j)
        {
            D[i][j]=D[i-1][j];
            if(G[i]<=j)
                D[i][j] = max(D[i][j], D[i - 1][j - G[i]] + P[i]);
        }
    Pmax=D[n][g];
    out<<Pmax;
    return 0;
}