重新排列数组元素，以获得最大的总和

I have an array whose length is exactly divisible by 3 and the elements are all in descending order. If we group the array elements by 3 and take the sum of it i should get the maximum values.I have an array whose length is exactly divisib