Cod sursa(job #2952496)
Utilizator | Data | 9 decembrie 2022 14:11:14 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,d[10001],G,g,p,maxim;
int main()
{
fin>>n>>G;
memset(d,-1,sizeof(d));
d[0]=0;
for(int i=1;i<=n;i++)
{ fin>>g>>p;
for(int j=G-g;j>=0;j--)
{
if(d[j]!=-1)
{
d[j+g]=max(d[j+g],d[j]+p);
}
}
}
for(int i=1;i<=G;i++)
{
if(d[i]>maxim)
maxim=d[i];
}
fout<<maxim;
return 0;
}