解题思路:
注意事项:
参考代码:
Scanner scanner=new Scanner(System.in); int m=scanner.nextInt(); int n=scanner.nextInt(); int [] v=new int [n+1]; int [][] arr=new int [n+1][m+1]; for (int i =1 ; i <=n; i++) { v[i]=scanner.nextInt(); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (v[i]<=j) { arr[i][j]=Math.max(arr[i-1][j],arr[i-1][j-v[i]]+v[i] ); }else { arr[i][j]=arr[i-1][j]; } } } System.out.println(m-arr[n][m]);
0.0分
2 人评分