So there are two boxing teams, my team A and the opposing team B, each with m boxers. Based on the player's ranking of skill, x_subscript(i) being the ranking for ith boxer for team A and y_subscript(k) being the ranking for kth box for team B. Each fight round is set up one boxer from team A against one boxer from team B at a time. I get to set up who goes against whom, so I need to make sure the boxer from my team A has a higher ranking than the boxer from team B for as many rounds as possible.

I need to provide a greedy algorithm and prove that it's correct, and come up with the running time.

It's a type permutation, scheduling with deadlines and apply the inversion, but I am stuck on how to start. Could someone provide a guidace?