Leetcode 1665. Minimum Initial Energy to Finish Tasks

Given tasks specified by (actual, minimum) energy where you must have at least minimum energy to start a task and then lose actual energy, find the smallest initial energy that allows completing all tasks in some order. The core challenge is choosing an order (greedy/sorting) that minimizes the required starting resource under constraints up to 1e5 tasks.