function hap(arr){
return arr.reduce((val,acc)=>val+acc,0);
}
function solution(bridge_length, weight, truck_weights) {
let answer = 0;
let bridge=Array.from({length:bridge_length},()=>0);//다리 배열을 모두 0값으로 초기화
while(truck_weights.length){
bridge.shift();
answer++;
if(truck_weights[0]+hap(bridge)<=weight){
bridge.push(truck_weights.shift());
}else{
bridge.push(0);
}
}
answer+=bridge_length;// 마지막 대기트럭이 다리를 건너는데 걸리는 시간
return answer;
}