Cod sursa(job #2868041)
| Utilizator | Data | 10 martie 2022 18:22:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[5001],p[5001];
int optim[10001];
int main()
{
int n,g,i,j,sol=0;
fin>>n>>g;
for(i=1; i<=n; i++)
{
fin>>w[i]>>p[i];
}
for(i=1; i<=n; i++)
{
for(j=g-w[i]; j>=0; j--)
{
if(optim[j+w[i]]<optim[j]+p[i])
{
optim[j+w[i]]=optim[j]+p[i];
if(sol<optim[j+w[i]])
sol=optim[j+w[i]];
}
}
}
fout<<sol;
return 0;
}
