Cod sursa(job #1508436)
Utilizator | Data | 22 octombrie 2015 16:09:14 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,g,a,b,Max,v[5001],i,j;
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++)
{
fin>>a>>b;
for(j=g-a;j>=0;j++)
{
if(v[j]!=0||j==0)
v[j+a]=max(v[j]+b,v[j+a]);
}
}
Max=-1;
for(i=1;i<=n;i++)
{
Max=max(Max,v[i]);
}
fout<<Max;
return 0;
}