Maximum Point

CodeChefOpen on judge ↗

Brahmesh likes to play a special type of game and he want to earn maximum points in game so that he can win the game. You are given a array of n elements. there are some rules in game: 1. In one move he can choose an element from array lets say x and delete it from array. 2. Element equal to x-1 and x+1 also must be deleted from array. 3. this move brings x point to Brahmesh. calculate m

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI