排序。当有 n 件任务同时来临时，每件任务需要用时ni，求让所有任务等待的时间和最小的任务处理顺序。-Sort. When there are n pieces tasks simultaneously comes when each task needs ni, seeking to make all the tasks waiting time and minimum of tasking order.