You are given two $0$ indexed integer arrays, players and trainers.

The value players[i] represents the ability of the $i^{ {th}}$ player, and trainers[j] represents the training capacity of the $j^{ {th}}$ trainer.

The $i^{ {th}}$ player can be matched with the $j^{ {th}}$ trainer if and only if players[i] $\leq$ trainers[j]. Each player can be matched with at most $1$ trainer, and each trainer can be matched with at most $1$ player.

Return the maximum number of matchings that can be formed between players and trainers.

Constraints:

• $1 \leq$ players.length, trainers.length $\leq 10^5$

• $1 \leq$ players[i], trainers[j] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.