Cod sursa(job #2880316)
Utilizator | Data | 29 martie 2022 16:55:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int GMAX=10005;
int d[GMAX];
const int INF=-1e9;
int main()
{
int n,i,j,g,p,w,last;
fin>>n>>g;
d[0]=0;
for(i=1;i<=g;i++)
d[i]=INF;
last=0;
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=last;j>=0;j--)
{
if(j+w>g)
continue;
if(d[j]!=INF)
if(d[j+w]<d[j]+p)
{
d[j+w]=d[j]+p;
if(j+w>last)
last=j+w;
}
}
}
int pmax=0;
for(j=1;j<=g;j++)
if(d[j]>pmax)
pmax=d[j];
fout<<pmax<<"\n";
fin.close(); fout.close();
return 0;
}