Leetcode 2592. Maximize Greatness of an Array

Given an integer array, permute its elements to maximize the number of indices i with perm[i] > nums[i]. The core challenge is a matching problem on multisets (with duplicates) that is solved greedily by sorting and pairing each original value with the smallest available larger element to maximize wins.