문제
풀이
#include <string>
#include <vector>
using namespace std;
vector<int> solution(vector<int> progresses, vector<int> speeds) {
vector<int> answer;
for (;;)
{
for (int i = 0; i < progresses.size(); i++)
{
progresses[i] += speeds[i];
}
if (progresses[0] >= 100)
{
int count = 0;
for (;;)
{
if (progresses.empty())
{
answer.push_back(count);
return answer;
}
else if (progresses[0] >= 100)
{
progresses.erase(progresses.begin()+ 0);
speeds.erase(speeds.begin() +0);
count++;
}
else if (progresses[0] < 100)
{
answer.push_back(count);
break;
}
}
}
else if (progresses.empty())
{
return answer;
}
}
}