Cod sursa(job #1002041)
Utilizator | Data | 26 septembrie 2013 19:33:48 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int G,n,i,j,Max,Maxp,a[10000],p[10000];
int main()
{
f>>n>>G; Maxp=0;
for(i=1;i<=n;i++)
f>>a[i]>>p[i];
for(i=1;i<=1<<n;i++)
{ Max=0;
for(j=1;j<=n;j++)
if(i%2==1)
if(a[j]<=G)
Max=Max+p[j];
if(Max>Maxp) Maxp=Max;
}
g<<Maxp<<'\n';
return 0;
}