Job Sequencing Problem

Given `n` jobs where every job has a deadline and associated profit if finished before or at the deadline. It is known that every job takes a single unit of time, so the minimum possible deadline for any job is `1`. Maximize the total profit earned by scheduling jobs without overlapping time slots. ### Constraints - `1 <= n <= 10^4` - `1 <= deadline[i] <= 10^3` - `1 <= profit[i] <= 10^5` ### Input Format - Line 1: Space-separated integers representing `deadlines`. - Line 2: Space-separated integers representing `profits`. ### Output Format Print the maximum profit achievable.