It's O(logn) but you haven't accounted for how heavy each item in the array of n is.

This is true, but it probably isn't a box of books that's beeping.

I also feel like ordering the moves by lightest box first is reasonable as a real-world optimization.

Lol classic “ignore the constant factor” gotcha when using Big-O.