import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int V = sc.nextInt();
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
System.out.println(minSpace(V,arr,0));
}
public static int minSpace(int V, int[] arr,int index) {
if (index == arr.length) {
return V;
}
//不选
int res = minSpace(V, arr, index + 1);
//选
if(V>=arr[index]) {
res = Math.min(res,minSpace(V - arr[index], arr, index + 1));
}
return res;
}
}
P1049 装箱问题 递归经典题2
最新推荐文章于 2024-07-27 13:31:57 发布