문제 링크 - https://programmers.co.kr/learn/courses/30/lessons/42586
sum
: 완료된 기능 전체 갯수cnt
: index번째 기능이 완료되었을때 함께 완료된 기능 갯수index
: progresses 앞에서 부터 탐색할때의 index#include <string>
#include <vector>
using namespace std;
vector<int> solution(vector<int> progresses, vector<int> speeds) {
vector<int> answer;
int index=0;
int cnt=0;
int sum=0;
while(true){
for(int i=0; i<progresses.size(); i++){
progresses[i]+=speeds[i];
}
cnt=0;
if(progresses[index]>=100){
for(int j=index; j<progresses.size(); j++){
if(progresses[j]>=100){
cnt++;
if(j==progresses.size()-1){
answer.push_back(cnt);
sum+=cnt;
break;
}
}else{
index=j;
answer.push_back(cnt);
sum+=cnt;
break;
}
}
}
if(sum==progresses.size()){
break;
}
}
return answer;
}