Find the kth smallest subarray sum of an array, and the input array can have negative elements as well.

I could only code the max-heap approach : O(n^2log(k))