Cod sursa(job #3171087)
| Utilizator | Data | 18 noiembrie 2023 12:52:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,sol,w[5005],p[5005],best[10005];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int j=g-w[i];j>=0;j--)
{
if(best[j+w[i]]<best[j]+p[i])
{
best[j+w[i]]=best[j]+p[i];
if(best[j+w[i]]>sol)
{
sol=best[j+w[i]];
}
}
}
}
fout<<sol;
fin.close();
fout.close();
return 0;
}
