Cod sursa(job #1394693)

Utilizator relu.draganDragan Relu relu.dragan Data 20 martie 2015 16:20:05
Problema Problema rucsacului Scor 25
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
#include <vector>
using namespace std;
int max(int a, int b)
{
    if (a > b) 
        return a;
    else
        return b;
}

int main()
{
    ifstream in("rucsac.in");
    ofstream out("rucsac.out");
    int N, G, i, j,x;
    vector<int> W, P;
    W.push_back(0);
    P.push_back(0);

    //citire
    in >> N >> G;
    int C[N+1][10000];
    for (i = 1; i < N+1; ++i)
        in >> x, W.push_back(x), in >> x, P.push_back(x);

    for (i = 0; i < N+1; ++i)
        C[i][0] = 0;
    for (i = 0; i < G+1; ++i)
        C[0][i] = 0;

    for (i = 1; i < N+1; i++)
        for ( j = 1; j < G+1; j++)
        {
            if (j - W[i] < 0)
                C[i][j] = C[i-1][j];
            else
                C[i][j] = max(C[i-1][j], C[i-1][j - W[i]] + P[i]);
        }
    /*for (i = 1; i < N+1; i++)
    {
        for (j = 1; j < G+1; j++)
            out << C[i][j] << " ";
        out << endl;
    }*/
    out << C[N][G];
    return 0;

}