用回溯算法实现,首先找出已给定的数组其中的k个数的组合,在计算这k个数的和
package Main;
import java.util.List;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static List<Integer> list = new ArrayList<Integer>();
public static int res = 0;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < a.length; i++) {
a[i] = in.nextInt();
}
dfs(a, 0, k);
System.out.println