第一题 public static int shake(long[] arr) { Arrays.sort(arr); long cur = arr[0]; int fail = 0; for (int i = 1; i < arr.length; i++) { if (cur < arr[i]) fail = i; cur += arr[i]; } return arr.length - fail; }