Cod sursa(job #2060979)

Utilizator NannyiMaslinca Alecsandru Mihai Nannyi Data 8 noiembrie 2017 20:35:21
Problema Problema rucsacului Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>
using namespace std;
#define nmax 5010

ifstream f("rucsac.in");
ofstream w("rucsac.out");

int n,gmax,g[nmax],high,cost[nmax],dp[nmax*2];

int main()
{
    f>>n>>gmax;
    for (int i=1; i<=n; ++i)
        f>>g[i]>>cost[i];
    for (int i=1; i<=n; ++i)
        for (int j=gmax-g[i]; j>=0; --j)
        {
            if (dp[j+g[i]]<dp[j]+cost[i])
            {
                dp[j+g[i]=dp[j]+cost[i];
                   high=max(high,dp[j+g[i]]);
            }
        }
    w<<high;
    return 0;
}