Cod sursa(job #2075225)

Utilizator raulrusu99Raul Rusu raulrusu99 Data 25 noiembrie 2017 12:01:18
Problema Problema rucsacului Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <iostream>
#include <fstream>
#define N_MAX 5005
#define W_MAX 10005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int dp[2][W_MAX], w[N_MAX], p[N_MAX], n, W;
void copyToFirst()
{
    for(int i = 0; i <= W; i++)
        dp[0][i] = dp[1][i];
}
int main()
{
    f >> n >> W;
    for(int i = 1; i <= n; i++)
        f >> w[i] >> p[i];
    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j <= W; j++)
            if(dp[i % 2][j])
            {
                dp[(i + 1) % 2][j] = max(dp[i % 2][j], dp[(i + 1) % 2][j]);
                if(j + w[i] <= W)
                    dp[(i + 1) % 2][j + w[i]] = max(dp[i % 2][j] + p[i], dp[(i + 1) % 2][j + w[i]]);
            }

        dp[(i + 1) % 2][w[i]] = max(dp[(i + 1) % 2][w[i]], p[i]);
    }
    int rez = -1;
    for(int i = 0; i <= W; i++)
        rez = max(rez, dp[(n + 1) % 2][i]);
    g << rez;
    return 0;
}