Cod sursa(job #2050426)

Utilizator ZenoTeodor Anitoaei Zeno Data 28 octombrie 2017 09:52:01
Problema Problema rucsacului Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>
#define NMAX 5001

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, g, M[NMAX][2 * NMAX], G[NMAX], C[NMAX];

int main()
{
    fin >> n >> g;
    for(int i = 1; i <= n; i++) {
        fin >> G[i] >> C[i];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= g; j++) {
            if(j >= G[i])
                M[i][j] = max(M[i - 1][j - G[i]] + C[i], M[i - 1][j]);
            else M[i][j] = M[i - 1][j];
        }
    }
    int ma = 0;
    for(int i = 1; i <= g; i++) {
        ma = max(ma, M[n][i]);
    }
    fout << ma << '\n';
    return 0;
}