Cod sursa(job #1619252)
Utilizator | Data | 28 februarie 2016 14:18:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,g1,p1,i,j,a[10001],v,maxx;
int main()
{fin>>n>>g;
for(i=1;i<=g;i++)
a[i]=-1;
for(i=1;i<=n;i++)
{
fin>>g1>>p1;
for(j=g-g1;j>-1;j--)
{
if(a[j]!=-1)
{
v=a[j]+p1;
if(a[j+g1]<v)a[j+g1]=v;
if(v>maxx)maxx=v;
}
}
}
fout<<maxx;
return 0;
}