class Solution {  
  
    static class Task {  
        private int requestTime;  
        private int processingTime;  
  
        public Task(int requestTime, int processingTime) {  
            this.requestTime = requestTime;  
            this.processingTime = processingTime;  
        }  
  
    }  
  
    public int solution(int[][] jobs) {  
  
        PriorityQueue<Task> ready = new PriorityQueue<>((o1, o2) -> o1.processingTime - o2.processingTime);  
        PriorityQueue<Task> wait = new PriorityQueue<>((o1, o2) -> o1.requestTime - o2.requestTime);  
        int totalCostedTime = 0;  
        int totalWaitedTime = 0;  
        int idleTime = 0;  
        int count = 0;  
  
        for (int[] job : jobs) {  
            wait.offer(new Task(job[0], job[1]));  
        }  
  
        while (count < jobs.length) {  
            while (!wait.isEmpty() && wait.peek().requestTime <= totalCostedTime) {  
                ready.offer(wait.poll());  
            }  
  
            if (ready.isEmpty()) {  
                idleTime += wait.peek().requestTime - totalCostedTime;  
                totalCostedTime = wait.peek().requestTime;  
            } else {  
                Task job = ready.poll();  
                totalWaitedTime += totalCostedTime - job.requestTime;  
                totalCostedTime += job.processingTime;  
                count++;  
            }  
        }  
        return (totalCostedTime + totalWaitedTime - idleTime) / jobs.length;  
    }  
}