Cod sursa(job #1520500)
Utilizator | Data | 8 noiembrie 2015 21:11:00 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int maxim,N,G,w[5001],p[5001],sol[5001];
int main()
{
f>>N>>G;
for(int i=1;i<=N;++i)
f>>w[i]>>p[i];
for(int i=1;i<=N;++i)
for(int j=G-w[i];j>-1;--j)
{
sol[j+w[i]]=max(sol[j+w[i]],sol[j]+p[i]);
if(sol[j+w[i]]>maxim)
maxim=sol[j+w[i]];
}
g<<maxim;
g.close();
}