우주의WouldYou

#include <string>
#include <vector>
#include <queue>

using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    vector<int> answer;
    queue <int> left_day;
    int day = 0;
    for(int i =0; i < progresses.size(); i++){
        int cal = (100-progresses[i]) % speeds[i];
        int cal2 = (100-progresses[i]) / speeds[i];
        if(cal != 0){
            left_day.push(cal2+1);
        }
        else 
            left_day.push(cal2);
    }
    while(!left_day.empty()){
        day = 0;
        int now_n = left_day.front();
        left_day.pop();
        day+=1;
        while(!left_day.empty()){
            int next_n = left_day.front();
            if(now_n >= next_n){
                left_day.pop();
                day+=1;
            }
            else
                break;
        }
        answer.push_back(day);
    }
    return answer;
}