#33🤔 기능개발

import java.util.Queue;
import java.util.LinkedList;
import java.util.List;
import java.util.ArrayList;

class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        Queue<Double> queue = new LinkedList<>();
        for(int i = 0; i < progresses.length; i++) {
            int tmp = (100 - progresses[i]) / speeds[i];
            if(((100 - progresses[i]) % speeds[i]) == 0) {
                queue.add((double) tmp);    
            } else {
                queue.add(tmp + 0.1);    
            } 
        }
        
        List<Integer> list = new ArrayList<>();
        
        int deploy = 0;
        while(!queue.isEmpty()) {
            double front = queue.poll();
            deploy++; // 처음 무조건 하나는 배포
            
            while(queue.size() > 0 && front >= queue.peek()) {
                queue.poll();
                deploy++;
            }
            
            list.add(deploy);
            deploy = 0;
        }

        int[] answer = new int[list.size()];
        for(int i = 0; i < list.size(); i++) {
            answer[i] = list.get(i);
        }
        return answer;
    }
}
// 100 - 90 = 10 / 10 = 1
// 100 - 90 = 10 / 9  = 1.111111111111111...

// 100 - 93 = 7  / 1  = 7;
// 100 - 30 = 70 / 30 = 2.3333...
// 100 - 55 = 45 / 5  = 9;

// 100 - 95 = 5
// 100 - 90 = 10
// 100 - 99 = 1
// 100 - 99 = 1
// 100 - 80 = 20
// 100 - 99 = 1