Maximum matching of players with trainers

Array Two Pointers Greedy Sorting

75.2% acceptance

Feb 25, 2026

920

You are given a 0-indexed integer array players, where players[i] represents the ability of the ith player. You are also given a 0-indexed integer array trainers, where trainers[j] represents the training capacity of the jth trainer. The ith player can match with the jth trainer if the player's ability is less than or equal to the trainer's training capacity. Additionally, the ith player can be matched with at most one trainer, and the jth trainer can be matched with at most one player. Return the maximum number of matchings between players and trainers that satisfy these conditions.

Solution

Rust

Time O(n log n)

Space O(1)

LeetCode

solution.rs

impl Solution {
  pub fn match_players_and_trainers(mut players: Vec<i32>, mut trainers: Vec<i32>) -> i32 {
    players.sort();
    trainers.sort();
    let mut i = 0;
    let mut j = 0;
    let mut count = 0;
    while i < players.len() && j < trainers.len() {
      if players[i] <= trainers[j] {
        count += 1;
        i += 1;
        j += 1;
      } else {
        j += 1;
      }
    }
    count
  }
}