Cod sursa(job #1267775)
Utilizator | Data | 20 noiembrie 2014 11:58:07 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,j,i,w,p,v[10001],Max;
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++)
{
v[i]=-1;
}
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=n-w;j>=0;j--)
if(v[j]!=-1&&v[j+w]<v[j]+p)
v[j+w]=v[j]+p;
}
for(i=1;i<=n;i++)
if(v[i]>Max)
Max=v[i];
fout<<Max;
}