[Programmers] 기능 개발

#include <string>
#include <vector>
#include <iostream>
#include <queue>
#define p pair<int,int>
using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    vector<int> answer;
    int size = (int)  progresses.size();
    queue<p> q;
    
    for(int i=0; i<size; i++){
        q.push( {progresses[i],i} );
    }
    
    int cnt = 0;
    int date;
    while(! q.empty()){
        if( cnt == 0) {
            int prog =  100 - q.front().first;
            int idx = q.front().second;
            q.pop();
            cnt ++;
            if( prog % speeds[idx] == 0){
                date = prog / speeds[idx];
            }
            else{
                date = prog / speeds[idx] + 1;
            }
        } // end of if
        else {
            int top = q.front().first;
            int idx = q.front().second;
            int remain_work = 100 - top;
            if(date * speeds[idx] >= remain_work){
                cnt ++;
                q.pop();
                continue;
            }
            else{
                answer.push_back(cnt);
                cnt = 0;
            }
        } // end of else
    } // end of while loop
    answer.push_back(cnt);
    return answer;
}