Arrange 3k+x numbers in k groups which the maximum difference between the minimum element and the maximum element of each group is minimized

Question

There are n = 3k+x numbers (0 <= x <= 2) and I wanna divide them into groups of exactly 3 members and remove the remaining elements. I wanna