Cod sursa(job #966950)

Utilizator alex_HarryBabalau Alexandru alex_Harry Data 26 iunie 2013 20:18:54
Problema Problema rucsacului Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct Rucsac{
int Profit;
int Weight;
};
Rucsac Arr[5002];
int DP1[10002],DP2[10002],N,G;
void Read()
{
    int i;
    f>>N>>G;
    for(i=1;i<=N;i++)
        f>>Arr[i].Weight>>Arr[i].Profit;
}
void Solve()
{
    int i=1,j;
    for(i=1;i<=G;i++)
    {
        if(Arr[i].Weight<=i)
            DP1[i]=Arr[1].Profit;
    }
    for(i=2;i<=N;i++)
    {
        for(j=1;j<=G;j++)
        {
            if(j>=Arr[i].Weight)
                DP2[j]=max(DP1[j],DP1[j-Arr[i].Weight]+Arr[i].Profit);
            else
                DP2[j]=DP1[j];
        }
        for(int k=1;k<=G;k++)
            DP1[k]=DP2[k];
    }
    g<<DP2[G]<<"\n";
}
int main()
{
    Read();
    Solve();
    return 0;
}