Cod sursa(job #1722196)
Utilizator | Data | 27 iunie 2016 16:06:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("rucsac.in");
ofstream so("rucsac.out");
int p[5005],g[5005];
int sol[10005];
int main()
{
int o,n;
si>>o>>n;
int i,j;
for(i=0;i<o;++i)
{
si>>g[i]>>p[i];
}
for(i=0;i<o;++i)
for(j=n;j>=g[i];--j)
{
sol[j]=max(sol[j],sol[j-g[i]]+p[i]);
}
so<<sol[n]<<'\n';
return 0;
}