Introduction - If you have any usage issues, please Google them yourself
Input the speed of n [1, 100] groups of Tian Ji and Qi Weiwang's horses, use the greedy method to find the maximum number of sets Tian Ji won (win - lose, draw is not divided), design the greedy strategy, and implement the program.
Input: group number n [1, 100], the speed of each group of horses of Tianji and qiweiwang. Each group contains two positive integers, representing the speed of this group of horses of Tianji and qiweiwang respectively;
Output: matching strategy, number of wins, number of losses, number of draws