Fractional Knapsack problem
#include
using namespace std;
float p[100],w[100];
float x[100];
void knapsack(int m,int n)
{
for(int i = 1; i p[maX]/w[maX])
{
maX = j;
}
}
swap(p[maX],p[i]);
swap(w[maX],w[i]);
}
int u = m;
int i;
for(i=1;i<=n;i++)
{
if(w[i]>u)
break;
x[i] = 1;
u = u-w[i];
}
if(i<=n)
{
x[i] = u/w[i];
}
}
void profit_calculation(int n)
{
float sum = 0;
for(int i = 1;i<=n;i++)
sum += x[i]*p[i];
cout<>n;
for(int i = 1;i<=n;i++)
{
cin>>p[i]>>w[i]; // Enter Profit space Weight respectively
}
cout<
|