Maximum Matching of Players With Trainers

Given arrays of player abilities and trainer capacities, pair each player to at most one trainer (and vice versa) so that a player’s ability ≤ trainer’s capacity and the number of pairs is maximized. This is a greedy sorting/two-pointer matching problem — sort both lists and scan to greedily assign the smallest capable trainer to each player.