Hello codeforces, I want your help in following permutation and combination problem.

We are given an arr of numbers and we want to find the no of ways to put all occurences of second max(arr) to left of the max(arr) and ofcourse all the numbers are different(for eg. 4 4, we can arrange these in two ways). I couldn't solve yesterday's C just because of this, so I wanna learn this now. Thanks and have a good day :)