输入n[1, 100]组田忌和齐威王的马的速度，使用贪心法求田忌胜出的最多盘数（赢局数—输局数，平局数不算分），设计贪心策略，实现程序。

　　 输入：组数n[1, 100]，田忌和齐威王每组马的速度，每一组包含两个正整数，分别表示这一组田忌和齐威王的马的速度；

　　输出：匹配策略，赢局数，输局数，平局数(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)