Jams

Boondex has decided to improve its traffic jams coloring algorithm to better meet drivers' expectations. To achieve this, Boondex has collected feedback from drivers as a set of $N$ integer pairs V_i, C_i, where V_i is the driver's speed and C_i (C_i \in \{0, 1, 2\}) is the color that the driver expects to see on the map for this speed.

Help Boondex find two integers $A$ and $B$ (0 \leq A \leq B) that will be used in the new traffic jams coloring algorithm. The color will be $0$ if 0 \leq V \leq A, $1$ if A+1 \leq V \leq B, and $2$ if B+1 \leq V. Values $A$ and $B$ should be chosen to minimize the number of cases in which the algorithm's selected color differs from the driver's expected color. Among all pairs $A$ and $B$ that minimize this count, choose the pair with the smallest A+B sum.