Use C$++$ programming or do it by hand: Let $S=\{a,b,c,d,e,f,g\}$ be a collection of different objects with a given value and weight.

Use fractional knapsack algorithm to fill a sack with maximum capacity of weight$=18$