kingsubin

import java.util.*;
 
class Solution {
 
    public int[] solution(int[] progresses, int[] speeds) {
        Queue<Integer> q = new LinkedList<>();
        List<Integer> list = new ArrayList<>();
        int length = progresses.length;
 
        for (int i = 0; i < length; i++) {
            int sum = progresses[i];
            int day = 0;
            while (sum < 100) {
                sum += speeds[i];
                day++;
            }
 
            q.offer(day);
        }
 
        Integer now = q.poll();
        int cnt = 1;
        while (!q.isEmpty()) {
            if (q.peek() <= now) {
                cnt++;
                q.poll();
 
            } else {
                list.add(cnt);
 
                now = q.poll();
                cnt = 1;
            }
 
            if (q.isEmpty()) list.add(cnt);
        }
 
        int[] ans = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            ans[i] = list.get(i);
        }
 
        return ans;
    }
}