Cursed Indices

You're given an array $A = [A_1, A_2, \ldots, A_N]$ of length $N$, containing **positive** integers. An index $i$ is said to be *cursed* if $A_1 + A_2 + \ldots + A_{i - 1} \ge A_i$. In particular, $A_i\geq 1$ means that index $1$ is always ***not*** *cursed*. You can rearrange $A$ as you wish to. Find the minimum possible number of *cursed* indices in the rearranged array. Also find *any* re