'Answer In c++ only:
Rohit is working in the Multinational company named Accenture_ He has empty boxes lying on the floor in row. The size of the boxes is provided in the form f identical members The size of the ith box is indicated by [i]: Since Rohit has small room, there is shortage of space. Therefore, he should reduce the number of lower boxes by inserting the box into another box at least twice the current box i.e. if we have to insert that box into the jth box then (2 [iJ) <= a [i]. Each box can contain one box and box stored in another box cannot hold any box itself: Find the minimum number of boxes left behind after placing boxes in each other.
Sample Input:
16
Sample Output:'