[Programmers/C++] 기능개발

출처

https://programmers.co.kr/learn/courses/30/lessons/42586

소스

#include <string>

#include <vector>
#include <queue>
#include <iostream>
using namespace std;
vector<int> solution(vector<int> pro, vector<int> spe) 
{
    vector<int> answer;
    queue<int> q;
    for(int i = 0; i < pro.size(); i++)
    {
        int date=0;
        while(pro[i] < 100)
        {
            pro[i]+=spe[i];
            date++;
        }
        q.push(date);
    }
    while(!q.empty())
    {
        int fir=q.front();
        q.pop();
        int n = 0;
        int q_cnt=1;
        while(n<q.size())
        {
            int cnt=q.front();
            if(fir >= cnt)
            {
                q.pop();
                q_cnt++;
            }
            else
                break;
        }
        answer.push_back(q_cnt);
    }
    return answer;
}