function sumTime(nPerson, K) { //选最高层批次
const N = nPerson.length;
var time = 0;
var n = Math.ceil(N / K);
for (var j = 0; j < n; j++) {
var max = [];
nPerson.sort(function (a, b) {
return a - b;
});
for (var i = 0; i < K; i++) {
max.push(nPerson.pop());
}
time += max[0];
}
return time;
}
console.log(sumTime([1, 5, 3, 6, 11, 9, 8], 3));
