[프로그래머스] : [1차]추석 트래픽

#include <string>
#include <vector>
#include <iostream>
#include <queue>
using namespace std;
void parse_time(string &line, int *start_time, int *end_time)
{   
 

    int hour=0;
    int mi=0;
    int sec=0;
    int ms=0;
    int cnt = 0;
    
    int play_sec = 0;
    int play_ms  = 0;
    for(int i = 11; i < line.size(); i++)
    {
        if (line[i] < '0' || line[i] > '9')
        {
            cnt++;
            continue;
        }
        else{
        if(cnt == 0)
            hour  = 10*hour + line[i] - '0';
        else if (cnt == 1)
             mi  = 10*mi + line[i] - '0';
        else if (cnt == 2)
            sec  = 10*sec + line[i] - '0';
        else if ( cnt == 3)
           ms  = 10*ms + line[i] - '0';
        else if (cnt == 4)
            play_sec  = 10*play_sec + line[i] - '0';
         else if (cnt == 5)
            play_ms  = 10*play_ms + line[i] - '0';
        }
    }
        if((play_sec *1000) + play_ms > 3000)
        {
            play_sec = 3;
            play_ms = 0;
        }
    *end_time = (hour*1000*60*60) + (mi*1000*60) + (sec*1000) + ms;
    *start_time = *end_time - (play_sec* 1000) - play_ms + 1;

}
int solution(vector<string> lines) {
    int answer = 1;
    int temp_start_time = 0;
    int temp_end_time = 0;

   priority_queue<int,vector<int>,less<int> > pq;
     parse_time(lines.back(),&temp_start_time, &temp_end_time);
    pq.push(temp_start_time);
    for(int i  = lines.size()-2 ;i >=0 ;i--)
    {   
        int start_time = 0;
        int end_time = 0;
        parse_time(lines[i],&start_time, &end_time);
        temp_start_time = pq.top();

        if (temp_start_time - 1000 < end_time )
            pq.push(start_time);
        else
        {
           
            while(1)
            {
                if(pq.empty())
                {
                    pq.push(start_time);
                    break;
                 }
                if (end_time <= pq.top() - 1000)
                    pq.pop();
                else
                {   pq.push(start_time);
                    break;
                }
            }
        }
         answer  = max(answer, (int)pq.size());
    }
    return answer;
  
}