Leetcode 3376. Minimum Time to Break Locks I

Given locks with required energies and a sword whose per-minute gain x starts at 1 and increases by k after each break, each lock takes ceil(strength[i] / x) minutes (energy resets after each break); find the order to break all locks that minimizes total minutes. The core challenge is choosing the optimal permutation (n ≤ 8) to minimize the sum of these ceil divisions, typically solved by exploring permutations or bitmask DP.