Cod sursa(job #2121529)
| Utilizator | Data | 3 februarie 2018 19:59:57 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[10005];
//int v[5005];
int main()
{
int n, gmax, i, j, last, g, p;
fin>>n>>gmax;
for(i=1;i<=gmax;i++)
d[i]=-1;
d[0]=0;
last=0;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=last;j>=0;j--)
{
if(j+g>gmax)
continue;
if(d[j]!=-1)
{
if(d[j+g]<d[j]+p)
{
d[j+g]=d[j]+p;
if(j+g>last)
last=j+g;
}
}
}
}
fout<<d[gmax]<<"\n";
return 0;
}
