きのうかいはつ

#include <string>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    vector<int> answer;
    queue<int> pro;
    
    int count=0;
    int sub=0;
    
    for(int i=0;i<progresses.size();i++){

        pro.push((int)ceil((100-progresses[i])/speeds[i]));
        
    }
    sub=pro.front();

    while(pro.empty()!=true){
        if(sub<pro.front()){
            sub=pro.front();
            pro.pop();
            answer.push_back(count);
            count=1;
        }
        else{
            count++;
            pro.pop();
        }
    }
    answer.push_back(count);    
    
    return answer;
}