Question

Alex has been preparing a box for handicraft. The box consists of N pieces of stones with each stone having a certain weight assigned to it. Each stone in the box will carry a different weight. This means no two stones can have the same weight. Alex wants to do this by making minimal changes in the original weight of the stones, making each stone weigh at least as much as its original weight. Find the minimum total weight that he can set for the box. Note: Stone weights are not in float value. Input 1. First input contains N, the total number of stones in the box 2. Second input contains N sorted integers separated by newline A1, A2 ... An, representing the original weights assigned to each stone. write the code​

Answer 1

Answer:

the boxconsists of N pieces of stones with each stone ha… ... 2. Alex has been preparing a box for handicraft. The box consists of N ... a certain weight assigned to it. ... will carry a different weight. ... stones can have the same weight. ... Input 1. First input contains N, the total number of stones in the box 2.

Explanation: