A shop in HackerLand contains n items where the price of theth item is price[i]. In one operation, the price of any one item can be increased or decreased by 1.
Given q queries denoted by the array query[], find the minimum number of operations required to make the price of all items equal to each query[i] (0 \le i