Sam is part of the organizing team arranging the university's career fair and has list of...

Transcribed Image Text:

Sam is part of the organizing team arranging the university's career fair and has list of companies and their respective arrival times and durations. Due to university-wide budqet cuts, there is only one stage/dais available on the entire campus so only one event can occur at a time. Given each company's arrival time and the duration they will stay, determine the maximum number of promotional events that can be hosted during the career fair. For example, there are n = 5 companies that will arrive at times arrival = [1, 3, 3, 5, 7] and will stay for duration = [2, 2, 1, 2, 1]. The first company arrives at time 1 and stays for 2 hours. At time 3, two companies arrive, but only 1 can stay for either 1 or 2 hours. The next companies arrive at times 5 and 7 and do not conflict with each other. In total, there can be a maximum of 4 promotional events. Function Description Complete the function maxEvents in the editor below. It must return an integer that represents the maximum number of promotional events that can be hosted. maxEvents has the following parameter(s): arrivallarrival[0],.arrivalſn- 1]]: an array of integers where th element is the arrival time of the th company. duration[duration(0.duration[n-1]]: an array of integers where (th element is the duration that the th company's stay at the career fair. Constraints • 1sns 50 • 1 s arrivali] s 1000 • 1 s duration[i) s 1000 • Both 'arrival array and 'duration' array will have equal number of elements Sam is part of the organizing team arranging the university's career fair and has list of companies and their respective arrival times and durations. Due to university-wide budqet cuts, there is only one stage/dais available on the entire campus so only one event can occur at a time. Given each company's arrival time and the duration they will stay, determine the maximum number of promotional events that can be hosted during the career fair. For example, there are n = 5 companies that will arrive at times arrival = [1, 3, 3, 5, 7] and will stay for duration = [2, 2, 1, 2, 1]. The first company arrives at time 1 and stays for 2 hours. At time 3, two companies arrive, but only 1 can stay for either 1 or 2 hours. The next companies arrive at times 5 and 7 and do not conflict with each other. In total, there can be a maximum of 4 promotional events. Function Description Complete the function maxEvents in the editor below. It must return an integer that represents the maximum number of promotional events that can be hosted. maxEvents has the following parameter(s): arrivallarrival[0],.arrivalſn- 1]]: an array of integers where th element is the arrival time of the th company. duration[duration(0.duration[n-1]]: an array of integers where (th element is the duration that the th company's stay at the career fair. Constraints • 1sns 50 • 1 s arrivali] s 1000 • 1 s duration[i) s 1000 • Both 'arrival array and 'duration' array will have equal number of elements

Answer rating: 100% (QA)

ANSWER CODE IN PYTHON def maxEventsarrivalTimesdurations n lenarrivalTimes uniqueArrival... View the full answer