Cod sursa(job #1632423)
Utilizator | Data | 6 martie 2016 09:47:37 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream out("rucsac.out");
int nr,gmax,i,j,n,g,v[10100];
int main()
{
f>>nr>>gmax;
for(j=0;j<=nr;j++)
{
f>>n>>g;
for(i=gmax-n;i>=0;i--)
{
if(v[i]!=0 || i==0)
if(v[i+n]<v[i]+g)
v[i+n]=v[i]+g;
}
}
int maxi=-1;
for(i=0;i<gmax;i++)
if(v[i]>maxi) maxi=v[i];
out<<maxi<<'\n';
f.close();
out.close();
return 0;
}