Cod sursa(job #1839847)
Utilizator | Alex Staicu novista | Data | 3 ianuarie 2017 15:23:03 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[10005],n,g,w[5001],p[5001];
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int rucsac()
{
int i,j;
for (i=1;i<=n;i++)
for (j=g;j>=w[i];j--)
v[j]=max(v[j],v[j-w[i]]+p[i]);
return v[g];
}
int main()
{
int i;
fin>>n>>g;
for (i=1;i<=n;i++)
fin>>w[i]>>p[i];
fout<<rucsac();
fin.close();
fout.close();
return 0;
}