Problem - Job Sequencing

Jobs have deadlines and profits. Each job takes $1$ unit of time.

You can do at most one job per time unit. Maximize profit.

Example: jobs = [(1,100), (2,20), (2,50)]. Format: (deadline, profit). Schedule job $1$ at time $1$ (profit $100$), job $3$ at time $2$ (profit $50$). Total: $150$. Job $2$ cannot fit.