Given an array of integers and an integer m, in one operation, choose atmost m numbers of the array and increment them.
What is the minimum no of operations to make all the elements in the array equal?
1 <= nums[i] <= 1e5
1 <= m <= 1e5
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | cry | 161 |
2 | awoo | 160 |
2 | maomao90 | 160 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 155 |
5 | nor | 155 |
7 | adamant | 153 |
8 | maroonrk | 152 |
8 | Um_nik | 152 |
10 | djm03178 | 146 |
Given an array of integers and an integer m, in one operation, choose atmost m numbers of the array and increment them.
What is the minimum no of operations to make all the elements in the array equal?
1 <= nums[i] <= 1e5
1 <= m <= 1e5
Name |
---|
.
assuming the numbers are incremented by one i think you can just sort the array and the biggest value minus the smallest would be the answer
why are you people upvoting my wrong solution this solution is wrong i posted the right one in the replies grahhhhh
nevermind i realized the issue with this approach i am so terrible at this. this doesnt work if the m integer is smaller
then i think you just sort an array and then while the smallest integer is smaller than the biggest you increment the smallest integers in the array with a for loop if the array is not smaller then the loop breaks
we add 1 to the counter and sort the array at the end of a while loop as well
i have no idea how to phrase any of this better i myself am probably on the same level of coding
heres the lump of python code that I THINK works:
bro do paste the question link