Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #2050593)
| Utilizator | Data | 28 octombrie 2017 10:34:52 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[10005];
int b[10005];
int g[5005];
int c[5005];
int n,S,i,j;
int main()
{
fin>>n>>S;
for(i=1; i<=n; i++)
fin>>g[i]>>c[i];
for(i=1; i<=n; i++)
{
for(j=1; j<=S; j++)
{
if(j>=g[i])
b[j]=max(a[j-g[i]]+c[i],a[j]);
else
b[j]=a[j];
}
for(j=1;j<=S;j++)
{
a[j]=b[j];
b[j]=0;
}
}
fout<< a[S]<< '\n';
return 0;
}
