Lets Levelize It

Problem Statement

Lets Levelize It Problem Description There are n jugs on the floor, numbered 1,2,3...n. Each jug is filled with water, where the initial height of the water level of i-th jug is h(i) units. You want to fill the jugs, so that the water level in each of the jugs becomes equal. There are 2 options to fill or not fill the jugs, which goes like below. You start filling the jugs on hour 1. During any jth hour, you have the following options : Choose a jug and fill the water in it. The height of the water level increases by 1 unit, if the hour is odd (1, 3, 5, ..) and it increases by 2 units, if the hour is even (2, 4, 6, ..). Or skip the hour without filling the jug. Please Note that you can't fill water in more than 1 jug in an hour. The task is to determine the minimum number of hours required, so that the height of the water level in each jug becomes equal. Input Format The first line of input contains an integer t which denotes the number of test cases. The first line of test case contai