Programmers algorithm - stack/queue

#include <string>
#include <vector>
#include <iostream> 
#include <queue>

using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    vector<int> answer;
    queue<int> q;
    
    for (int i; i < progresses.size(); i++) {
        int result = 100 - progresses[i];
        int days = result / speeds[i];
        if (100 % speeds[i] != 0) days += 1;
        q.push(days);
    }
    
    int day = q.front();
    q.pop();
    int cnt = 1;
    
    while (!q.empty()) {
        if (day < q.front()) {
            answer.push_back(cnt);
            day = q.front();
            cnt = 0;
        } else {
            cnt++;
            q.pop();
        }
    }
    if(cnt !=0) answer.push_back(cnt);
    
    return answer;
}