leftbeehind - bradendubois/competitive-programming GitHub Wiki
Left Beehind
ID: leftbeehind
Difficulty: 1.7
CPU Time: 1 second
Memory: 1024 MB
Solution
For this, one can just enumerate the cases regarding x and y for each line (x > y, x == y, x < y), but handle the special case where x == y before all the others.