Solution: Organizing a Lottery

Solution 1: Sorting all points

Consider an example with $n = 2$ segments $[l_1,r_1] = [4,10], [l_2,r_2] = [1,8]$ and $m=3$ points $p_1 =11,p_2 =7,p_3 =3$:

Let’s initialize $numberOfSegments$ to $0$ and scan the line above from the left to the right. We will increase (or decrease) $numberOfSegments$ by $1$ each time we encounter a left (or right) endpoint of an interval. Initially, $numberOfSegments$ ...