CF1342F Make It Ascending

You are given an array $ a $ consisting of $ n $ elements. You may apply several operations (possibly zero) to it. During each operation, you choose two indices $ i $ and $ j $ ( $ 1 \le i, j \le n $ ; $ i \ne j $ ), increase $ a_j $ by $ a_i $ , and remove the $ i $ -th element from the array (so the indices of all elements to the right to it decrease by $ 1 $ , and $ n $ also decreases by $ 1 $ ). Your goal is to make the array $ a $ strictly ascending. That is, the condition $ a_1 < a_2 < \dots < a_n $ should hold (where $ n $ is the resulting size of the array). Calculate the minimum number of actions required to make the array strictly ascending.

N/A

N/A

In the first test case, the sequence of operations changes $ a $ as follows: $ [2, 1, 3, 5, 1, 2, 4, 5] \rightarrow [2, 1, 3, 5, 1, 4, 7] \rightarrow [1, 3, 5, 1, 6, 7] \rightarrow [2, 3, 5, 6, 7] $ .