Minimum Unique Array Sum

Given an array of integers, increment any duplicate elements until all elements are unique.

Medium1/4/2024

Problem statement

Given an array of integers, increment any duplicate elements until all elements are unique. The task is to minimize the sum of the array after making all elements unique.

Example:

// With the input
[7, 2, 1, 2, 4, 3] 

// Increment a 2 to get 
[7, 2, 1, 3, 4, 3]
// Increment a 3 to get 
[7, 2, 1, 3, 4, 4]
// Increment a 4 to get 
[7, 2, 1, 3, 4, 5]
// every element is now unique
// => sum : 22

Problem leaderboard

#
Size
%
Users
#1
43 c.
Top 12%
Steffan
voytxt
#2
46 c.
Top 18%
tree
#3
53 c.
Top 29%
sean
lydxn
#4
54 c.
Top 41%
oskar
Ryan
#5
59 c.
Top 47%
Shanethegamer
#6
72 c.
Top 53%
scpchicken
#7
78 c.
Top 59%
Thomasdcrt
#8
79 c.
Top 65%
Natanaelel
#9
80 c.
Top 71%
maximec-indy
#10
83 c.
Top 76%
KrausRaus
#11
95 c.
Top 82%
Pascal
#12
114 c.
Top 88%
SephQ
#13
181 c.
Top 94%
ComputerKWasTaken
#14
447 c.
Top 100%
Abdelrahman