Codeforces 455A Boredom - Problem Statement

You have an array of positive integers. When you pick an element with value $k$:

$1.$ You earn $k$ points

$2.$ Delete THAT ONE element you chose

$3.$ Delete ALL elements equal to $k+1$ and $k-1$ Here's the key: you don't delete all occurrences of $k$ itself.

You only delete the one element you picked. Other elements with value $k$ can still be picked later. Goal: get the highest total points.