Pagini recente » Cod sursa (job #1330794) | Istoria paginii utilizator/vladbosulic109 | Cod sursa (job #256218) | Cod sursa (job #2016341) | Cod sursa (job #1002053)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int G,n,i,j,Max,x,Maxp,a[10000],p[10000],Sg;
int main()
{
f>>n>>G; Maxp=0;
for(i=1;i<=n;i++)
{f>>a[i];
f>>p[i];}
for(i=1;i<=1<<n;i++)
{ Max=0; x=i; Sg=0;
for(j=1;j<=n;j++)
{
if(x%2==1)
{Sg=Sg+a[j];
Max=Max+p[j];}
x/=2;}
if(Max>Maxp && Sg<=G) Maxp=Max;
}
g<<Maxp<<'\n';
return 0;
}