So remember, what is the greedy fractional solution, well, it packs the first k items, and then the item in which it gets stuck, namely, item k plus one, it fills up the knapsack fully with a suitable fraction of item k plus one, and the value that the algorithm gets is prorated according to the fraction that it fits in. 