package LeetCode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;

public class LC_2386_wrong {
    static ArrayList<Integer> path = new ArrayList<>();
    static ArrayList<Integer> sumList = new ArrayList<>();

    public static void main(String[] args) {
        System.out.println(kSum(new int[]{1,-2,3,4,-10,12},16));
        System.out.println(sumList.toString());
    }

    public static long kSum(int[] nums, int k) {
        boolean[] used = new boolean[nums.length];
        Arrays.fill(used, false);
        backTrack(nums, 0);
        sumList.sort(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o1-o2;
            }
        });
        return sumList.get(sumList.size() - k);
    }

    public static void backTrack(int[] nums, int startIdx) {
        if (startIdx > nums.length) {
            return;
        }
        sumList.add(path.stream().mapToInt(Integer::intValue).sum());
        for (int i = startIdx; i < nums.length; i++) {
            path.add(nums[i]);
            backTrack(nums, i+1);
            path.remove(path.size() - 1);
        }
    }
}