Consider the weights and values of items listed below. Note that there is only one unit of each item.
\[
\begin{array}{|l|c|c|}
\hline
\text{Item number} & \text{Weight (in Kgs)} & \text{Value (in rupees)} \\
\hline
1 & 8 & 48 \\
2 & 5 & 30 \\
3 & 3 & 18 \\
4 & 1 & 12 \\
\hline
\end{array}
\]
The task is to pick a subset of these items such that their total weight is no more than 10 Kgs and their total value is maximized. Moreover, the item may be split. The total value of items picked by an optimal algorithm is denoted by $V_{\text {opt }}$.
A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by $V_{\text {greedy }}$.
The value of $V_{\text {opt }}-V_{\text {greedy }}$ is __________.
