Challenge: Collecting Signatures

Problem

---

This problem is similar to the Covering Segments by Points Problem.

Covering Segments by Points

Find the minimum number of points needed to cover all given segments on a line.

Input: A sequence of $n$ segments $[l_{1} , r_{1} ],...,[l_{n}, r_{n}]$ ...