[UVA] 10020 - Minimal coverage
Minimal coverage
The Problem
Given several segments of line (int the X axis) with coordinates
[Li,Ri]. You are to choose the
minimal amount of them, such they would completely cover
the segment [0,M].
The Input
The first line is the number of test cas...
