最优服务次序

import java.util.*;public class MinV {public static void main(String[] args) {int[] data= {52, 16, 1, 99, 1000, 234, 33, 55, 99, 812};Arrays.sort(data);int sum = 0;for (int i = 0; i < data.length; i++) {System.out.print(" " + data[i] + " ");sum += data[i];}System.out.print("\n等待时间：");for (int i = 1; i < data.length; i++) {int waitI = 0;for (int j = i-1; j >= 0; j--) {waitI += data[j];}System.out.print(" " + waitI + " ");sum += waitI;}System.out.println("\n" + sum/data.length);}}