Find k subsets with sum of weights in decreasing order

Given distinct objects with non-negative weights, return k subsets with the sum of weights in decreasing order. Example Input weights = [3,1,4,2], k = 3 Output [7, 6, 6]