問題の説明

せいげんじょうけん

問題を解く

function solution(jobs) {
	let answer = 0;
	let time = 0;
	let j = 0;

	const priorityJobs = jobs.sort((a, b) => a[0] - b[0]);
	const priorityQueue = [];

	while (j < priorityJobs.length || priorityQueue.length !== 0) 
    	{
		if (priorityJobs.length > j && time >= priorityJobs[j][0]) {
			priorityQueue.push(priorityJobs[j++]);
			console.log(priorityQueue);
			priorityQueue.sort((a, b) => a[1] - b[1]);
			continue;
		}

		if (priorityQueue.length !== 0) {
			time += priorityQueue[0][1];
			answer += time - priorityQueue[0][0];
			priorityQueue.shift();
			console.log(priorityQueue);
		} else time = priorityJobs[j][0];
	}
	return Math.floor(answer / priorityJobs.length);
}

+再解読時の私のコード

チェックポイント