Cod sursa(job #1667815)
Utilizator | Data | 29 martie 2016 11:44:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream c("rucsac.in");
ofstream v("rucsac.out");
int b[10002],n,g,j,x,w,p;
int main()
{
c>>n>>g;
while(n--)
{c>>w>>p;
for(j=g;j>=0;j--)
if(j>=w)
x=max(x,b[j]=max(b[j],b[j-w]+p));
}
v<<x<<"\n";
}