Job scheduling maximum profit

You run a single-server batch system. Each job is given as [deadline, profit], takes exactly one time unit, and earns its profit only if it finishes at or before its integer deadline (slots are 1..deadline). At most one job can occupy a time slot. Return the maximum total profit achievable by choosing a feasible subset and an order. Deadlines and profits are positive; the list may be empty.