Problem: You are tasked with scheduling the repair of national bridges where each bridge has different repair costs, traffic volumes, and repair times. Design a Greedy algorithm to maximize the number of bridges repaired while minimizing traffic disruptions.