Count minimum steps to get the given desired array

Consider an array with n elements and value of all the elements is zero. We can perform following operations on the array. 

1. Incremental operations:Choose 1 element from the array and increment its value by 1.
2. Doubling operation: Double the values of all the elements of array.

We are given desired array target[] containing n elements. Compute and return the smallest possible number of the operations needed to change the array from all zeros to desired array.

Examples:

Input: target[] = {2, 3}
Output: 4
To get the target array from {0, 0}, we 
first increment both elements by 1 (2 
operations), then double the array (1 
operation). Finally increment second
element (1 more operation)
Input: target[] = {2, 1}
Output: 3
One of the optimal solution is to apply the 
incremental operation 2 times to first and 
once on second element.
Input: target[] = {16, 16, 16}
Output: 7
The output solution looks as follows. First 
apply an incremental operation to each element. 
Then apply the doubling operation four times. 
Total number of operations is 3+4 = 7

One important thing to note is that the task is to count the number of steps to get the given target array (not to convert zero array to target array). 
The idea is to follow reverse steps, i.e. to convert target to array of zeros. Below are steps.

Take the target array first. 
Initialize result as 0. 
If all are even, divide all elements by 2 
and increment result by 1. 
Find all odd elements, make them even by 
reducing them by 1. and for every reduction,
increment result by 1.
Finally, we get all zeros in target array.

Below is the implementation of above algorithm. 

Minimum number of steps required to get the given target array is 7

Time Complexity: O(nlogn)
Auxiliary Space: O(1)