⁴Note that the comparison function used with std::sort() must define a strict weak order. This means that if two skaters are tied, neither is “better than” the other. Otherwise, std::sort() may go into an infinite loop, exhaust the stack, and get a segmentation fault.