Cod sursa(job #2125760)
Utilizator | Bogosel Ovidiu Bogoo | Data | 8 februarie 2018 18:26:46 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int i,j,n,m,G,w[5001],p[5001],v[10001];
int main()
{
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>w[i]>>p[i];
for(j=1;j<=G;j++)
if(j>=w[1])
v[j]=p[1];
for(i=2;i<=n;i++)
for(j=G;j>=1;j--)
if(v[j]<p[i]+v[j-w[i]]&&j-w[i]>=0)
v[j]=p[i]+v[j-w[i]];
fout<<v[G];
return 0;
}