Cod sursa(job #1490242)
| Utilizator | Data | 22 septembrie 2015 23:52:35 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream afis("rucsac.out");
int n,g,i,w[5001],p[5001],m[10001],j,ma;
int main()
{
f>>n>>g;
for (i=1;i<=n;i++)
{
f>>w[i]>>p[i];
}
m[w[1]]=p[1];
for (i=2;i<=n;i++)
{
for (j=g-w[i];j>=0;j--)
{
if (m[j]!=0) m[j+w[i]]=max(m[j+w[i]],m[j]+p[i]);
m[w[i]]=max(m[w[i]],p[i]);
}
}
ma=0;
for (i=0;i<=g;i++)
ma=max(ma,m[i]);
afis<<ma;
return 0;
}
