cpu 스케줄링

package chapter3.sol5_cpu_스케줄링;

import java.util.*;

public class Solution {
	public int[] solution(int[][] tasks) {
		int[] answer = new int[tasks.length];
		Queue<int[]> q = new PriorityQueue<>(Comparator.comparingInt((int[] a) -> a[1]).thenComparingInt(a -> a[0]));
		int[] ch = new int[tasks.length];

		for (int s = 0, i = 0; ; s++) {
			for (int j = 0; j < tasks.length; j++) {
				if (tasks[j][0] <= s && ch[j] == 0) {
					q.offer(new int[] {j, tasks[j][1]});
					ch[j] = 1;
				}
			}
			if (!q.isEmpty()) {
				int[] poll = q.poll();
				answer[i++] = poll[0];
				s += poll[1] - 1;
			}
			if (i == tasks.length)
				break;
		}
		return answer;
	}

	public static void main(String[] args) {
		Solution T = new Solution();
		System.out.println(Arrays.toString(T.solution(new int[][] {{2, 3}, {1, 2}, {8, 2}, {3, 1}, {10, 2}})));
		System.out.println(Arrays.toString(T.solution(new int[][] {{5, 2}, {7, 3}, {1, 3}, {1, 5}, {2, 2}, {1, 1}})));
		System.out.println(
			Arrays.toString(T.solution(new int[][] {{1, 2}, {2, 3}, {1, 3}, {3, 3}, {8, 2}, {1, 5}, {2, 2}, {1, 1}})));
		System.out.println(Arrays.toString(T.solution(new int[][] {{999, 1000}, {996, 1000}, {998, 1000}, {999, 7}})));
	}
}

안녕하세요 정답 코드가 아닌 이 코드도 가능한지 궁금합니다!