Get Operations

Problem Overview

• Find the lexicographically smallest sequence of pivots that sorts processes by increasing resource counts using the minimum number of operations.
• Each operation picks x in the array and stably partitions processes into those with resources < x and those with resources ≥ x.
• Input: resource[n] with distinct integers (1≤n≤50, values ≤1e9); Output: int[] of x; if already sorted, return [-1].
• Domain: CPU reorders processes by resources; from Amazon interviews; a coding interview interview question problem.