프로그래머스_LV2_다리를 지나는 트럭

https://programmers.co.kr/learn/courses/30/lessons/42583

코딩테스트 연습 - 다리를 지나는 트럭 | 프로그래머스

---

---

#include <iostream>
#include <string>
#include <vector>
#include <deque>
 
using namespace std;
 
int solution(int bridge_length, int weight, vector<int> truck_weights) {
    int answer = 1;
    int cur_weight = 0;
    deque<pair<int, int>> truck_on_bridge;
    int i = 0;
    while (!truck_on_bridge.empty() || i < truck_weights.size()) {
        if (i < truck_weights.size()) {
            if (cur_weight + truck_weights[i] <= weight) {
                truck_on_bridge.push_back(make_pair(truck_weights[i], 0));
                cur_weight += truck_weights[i];
                i++;
            }
        }
        answer++;
        int pop_count = 0;
        for (int j = 0; j < truck_on_bridge.size(); j++) {
            truck_on_bridge[j].second++;
            if (truck_on_bridge[j].second == bridge_length) {
                cur_weight = cur_weight - truck_on_bridge[j].first;
                pop_count++;
            }
        }
        while(pop_count-- > 0) 
            truck_on_bridge.pop_front();
    }
    return answer;
}