1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include <string>
#include <vector>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
#define p pair<int,int>
int solution(int bridge_length, int weight, vector<int> truck_weights) {
    int answer = 0,len=truck_weights.size();
    vector<p> truck;
    for(int i=0;i<len;i++)
        truck.push_back(p(truck_weights[i],0)); // 트럭 시간,
    queue<p> q;
    int w=0,i=0,pop_cnt=0;
    while(1){
        ++answer;
        if(q.front().second+bridge_length==answer){
            w-=q.front().first;
            cout <<"pop truck:"<< q.front().first <<"  time:"<<answer<<endl;
            q.pop();
            pop_cnt++;
        }
        if(i!=len &&q.size()<bridge_length && w+truck[i].first <=weight){//올라갈수있어
            w+=truck[i].first;
            q.push(p(truck[i].first,answer));
            truck[i].second=answer;
            // cout <<"push truck:"<< truck[i].first <<"  time:"<<answer<<endl;
            i++;
        }
        
        if(pop_cnt==len)
            break;
   }
    return answer;
}