Cod sursa(job #1229992)
Utilizator | Data | 18 septembrie 2014 12:03:12 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream r("rucsac.out");
int n,g,v[10001],p,w,i,j,Max;
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(j=1;j<=g;j++)
if(v[j]>=Max)
Max=v[j];}
r<<Max;
return 0;
}