Cod sursa(job #1520372)
Utilizator | Data | 8 noiembrie 2015 17:31:57 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
unsigned int gr,n,v[5001],g[5001],a[10001],b[10001],i,j;
int main()
{
fin>>n;
fin>>gr;
for(int i=1;i<=n;i++)
{
fin>>g[i];
fin>>v[i];
}
for( i=1;i<=n;i++)
{
for( j=1;j<=gr;j++)
{
b[j]=max(a[j],v[i]+a[j-g[i]]);
}
for( j=1;j<=gr;j++)
{
a[j]=b[j];
}
}
fout<<b[gr-2];
}