Leetcode 3476. Maximize Profit from Task Assignment

Given arrays of task difficulties and corresponding profits plus worker abilities, assign at most one task to each worker (a worker can do any task with difficulty ≤ their ability) — tasks may be reused by multiple workers — to maximize the total profit. The core challenge is mapping each worker ability to the best achievable profit (commonly solved by sorting tasks and workers and maintaining a running maximum).