You are given an array A consisting of N integers (N is divisble by 3) and an integer K. In one move, you can decrease or increase any element by 1.
The task is to modify the array A using such moves in order to maximize the different between (N/3)th largest element and the (N/3)th smallest element of the results array. You can perform at most K moves