Cod sursa(job #1826700)
| Utilizator | Data | 10 decembrie 2016 19:28:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream gu("rucsac.out");
int n,g,i,j,sol,optim[10010],w[10010],p[10010];
int main()
{
f>>n>>g;
for(i=1;i<=n;i++)
f>>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(optim[j+w[i]]>sol)
sol=optim[j+w[i]];
}
gu<<sol;
return 0;
}
