B'You are given the array a consisting of n elements and the integer k <= n . You want to obtain at least k equal elements in the array a . In one move, you can make one of the following two operations: Your task is to calculate the minimum number of moves required to obtain at least k equal elements in the array. The first line of the input contains two integers n and k ( 1 <= k <= n <= 2 cdot 10^5 ) -- the number of elements in a and the required number of equal elements. The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ), where a_i is the i -th element of a . Print one integer -- the minimum number of moves required to obtain at least k equal elements in the array. '...