Link to the problem:- Equal Average
I have tried to solve this question by rearranging the array in a way that a sequence of length k gets repeated so that the average of all k length subsequences is same. Now I need to place the elements in their appropriate positions and check whether any such sequence is possible or not. For that I have used priority_queue. The elements with greater occurrences will be placed first at separations of k.
Here's my submission, but it's giving wa, I don't know where I'm getting wrong. Any help would be appreciated.
1 7 3 2 1 1 2 1 1 2
0118 999 881 999 119 725 3
Ok, I got it, placing elements just on the basis of the count of their occurrences will not work.
Can you suggest any other approach?. Thanks