Add solution for UVA 11389 The Bus Driver Problem
Greedy Method

consider d1, d2 denotes two different lengths of day routes, d1 < d2
         s1, s2 are two different lengths of evening routes, s1 < s2

if (d1 + s2) > d, then (d2 + s2) > (d1 + s2) > d
=> we should let (d1 + s2) to minimize the cost to pay for overtime
driving