Editing 2015 Dec Bronze Problem 2 Speeding Ticket (section)

== Solution ==

To solve this problem, we need to iterate through each segment of the road and find the maximum amount that Bessie's speed exceeded the speed limit.

We first read the input data, storing the lengths and speed limits for each road segment. We then do the same for Bessie's speeds. Next, we initialize a variable to store the maximum speed over the limit that Bessie was driving.

We loop through each road segment, comparing Bessie's speed to the speed limit. If Bessie's speed exceeds the limit, we update the maximum speed over the limit if necessary.

After checking all road segments, the maximum speed over the limit is the severity of Bessie's speeding ticket. If Bessie never exceeded the speed limit, the ticket's severity is 0.

We can implement this solution in any programming language that supports basic array manipulation and arithmetic operations. The time complexity is O(N), where N is the number of road segments, as we need to examine each segment exactly once.