Cod sursa(job #1229994)
Utilizator | Data | 18 septembrie 2014 12:06:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream q("rucsac.out");
int v[10001],Max,i,n,g,w,p,j;
int main()
{
f>>n>>g;
for(i=1;i<=g;i++)
{
v[i]=-1;
}
for(i=1;i<=n;i++)
{
f>>w>>p;
for(j=g-w;j>=0;j--)
{
if(v[j]!=-1&&v[j+w]<v[j]+p)
v[j+w]=v[j]+p;
}
}
for(i=1;i<=g;i++)
{
if(Max<v[i])
Max=v[i];
}
q<<Max;
return 0;
}