Cod sursa(job #2880315)
Utilizator | Data | 29 martie 2022 16:54:52 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
const int GMAX = 10000;
int d[GMAX+5];
const int INF=-1e9;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
int n,G,w,p,i,j,last,pmax;
in>>n>>G;
d[0]=0;
for(i=1;i<=G;i++)
d[i]=INF;
last=0;
for(i=1;i<=n;i++)
{
in>>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;
}
}
}
pmax=0;
for(j=1;j<=G;j++)
if(d[j]>pmax)
pmax=d[j];
out<<pmax<<"\n";
return 0;
}