you give 0indexed integer array player playersi represent ability ith player you give 0indexed integer array trainer trainersj represent training capacity jth trainerthe ith player match jth trainer player ability equal trainer training capacity additionally ith player match trainer jth trainer match playerreturn maximum number matching player trainer satisfy condition Example 1input player 479 trainer 8258output 2explanationone way form matching follow players0 match trainers0 4 8 players1 match trainers3 7 8it prove 2 maximum number matching formedExample 2input player 111 trainer 10output 1explanationthe trainer match 3 playersEach player match trainer maximum answer 1 Constraints1 playerslength trainerslength 1051 playersi trainersj 109