Hello Codeforces,

I recently solved the problem about Alice and Bob playing on an array (choose value x, gain points equal to its frequency, then decrease those x by 1). My solution was accepted during the contest(339599945).

However, I am still not fully confident about the proof of correctness. I would really appreciate it if someone could provide a clear proof or explanation showing why this greedy strategy is optimal.