Nobita And Programming Classes

#1

Nobita has started taking Programming Classes. His teacher has given him a new assignment. Nobita has solved all the questions except for the last one. He needs your help in solving the last question. The question is:
Given an array of n integers.Convert it to an array with at least k equal numbers in minimum operation.
In one operation, you can choose any ai and set a[i]=a[i]/2(rounding down) , where a is the array given as input and i is any index of the array.
Can you help him to solve the problem?
Input Format

The first line contains two integer n (the number of elements in the array) and k ( as defined in problem).
Next line contains n space separated integer - the elements of the array.
Constraints

1<= n <= 100000
1<= k <=n
1 <= a[i] <= 100000
Output Format

Print a single integer equal to the minimum operation required.
Sample Input

4 4
1 1 1 4

Sample Output

2

Explanation

To get at least 4 equal numbers, we can do 4 -> 2 -> 1.
Then the array will be [1,1,1,1].
The number of operation is 2 (4 -> 2 then 2-> 1).

#2

hello @Kash-Moulik-3715574511847721
pls send the original problem link with me.

#3

@Kash-Moulik-3715574511847721

this should be the approach to solve this problem.
Every integer X can be divided by 2 log2(X) times to get a non-zero value. Hence, we need to perform these log2(arr[i]) operations on every array element arr[i] and for every value obtained after a division, store the number of operations required to reach the respective value. Once, all operations are performed for all array elements, for every value that at least K array elements have been reduced to at some point, find the sum of smallest K operations required among all of them. Find the minimum number of operations required among all such instances.

#4

https://hack.codingblocks.com/app/dcb/1749

#5

ron, Magnet and Wall (help me understand and solve in cpp) Chef loves to play with iron (Fe) and magnets (Ma). He took a row of N cells (numbered 1 through N) and placed some objects in some of these cells. You are given a string S with length N describing them; for each valid i, the i-th character of S is one of the following: ‘I’ if the i -th cell contains a piece of iron ‘M’ if the i -th cell contains a magnet ‘’ if the i -th cell is empty ‘:’ if the i -th cell contains a conducting sheet ‘X’ if the i -th cell is blocked If there is a magnet in a cell i and iron in a cell j, the attraction power between these cells is Pi,j=K+1−|j−i|−Si,j, where Si,j is the number of cells containing sheets between cells i and j. This magnet can only attract this iron if Pi,j>0 and there are no blocked cells between the cells i and j . Chef wants to choose some magnets (possibly none) and to each of these magnets, assign a piece of iron which this magnet should attract. Each piece of iron may only be attracted by at most one magnet and only if the attraction power between them is positive and there are no blocked cells between them. Find the maximum number of magnets Chef can choose. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains two space-separated integers N and K . The second line contains a single string S with length N . Output For each test case, print a single line containing one integer ― the maximum number of magnets that can attract iron. Constraints 1≤T≤2,000 1≤N≤105 0≤K≤105 S contains only characters ‘I’, ‘M’, '’, ‘:’ and ‘X’ the sum of N over all test cases does not exceed 5⋅106 Subtasks Subtask #1 (30 points): there are no sheets, i.e. S does not contain the character ‘:’ Subtask #2 (70 points): original constraints Example Input 2 4 5 I::M 9 10 MIM_XII:M Example Output 1 2 Explanation Example case 1: The attraction power between the only magnet and the only piece of iron is 5+1−3−2=1 . Note that it decreases with distance and the number of sheets. Example case 2: The magnets in cells 1 and 3 can attract the piece of iron in cell 2, since the attraction power is 10 in both cases. They cannot attract iron in cells 6 or 7 because there is a wall between them. The magnet in cell 9 can attract the pieces of iron in cells 7 and 6; the attraction power is 8 and 7 respectively.

#6

bro raise new doubt for different question with problem link.

also pls dont ask doubt for the questions which are live. (u can ask them after contest get finished).

#7

but contest ended isnit ?

#8

u were asking question of todays code byte , thats why i was saying that

image

its live

#9

cpp solution please

#10

@Kash-Moulik-3715574511847721
i dont have code for this problem
check the editorial for the code .

#11

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.