2410 - Maximum Matching of Players With Trainers\.

Medium

You are given a 0-indexed integer array players, where players[i] represents the ability of the <code>i^th</code> player. You are also given a 0-indexed integer array trainers, where trainers[j] represents the training capacity of the <code>j^th</code> trainer.

The <code>i^th</code> player can match with the <code>j^th</code> trainer if the player's ability is less than or equal to the trainer's training capacity. Additionally, the <code>i^th</code> player can be matched with at most one trainer, and the <code>j^th</code> trainer can be matched with at most one player.

Return the maximum number of matchings between players and trainers that satisfy these conditions.

Example 1:

Input: players = 4,7,9, trainers = 8,2,5,8

Output: 2

Explanation:

One of the ways we can form two matchings is as follows:

• players0 can be matched with trainers0 since 4 <= 8.

• players1 can be matched with trainers3 since 7 <= 8.

It can be proven that 2 is the maximum number of matchings that can be formed.

Example 2:

Input: players = 1,1,1, trainers = 10

Output: 1

Explanation:

The trainer can be matched with any of the 3 players.

Each player can only be matched with one trainer, so the maximum answer is 1.

Constraints:

• <code>1 <= players.length, trainers.length <= 10⁵</code>

• <code>1 <= playersi, trainersj<= 10⁹</code>