You are on a flight and want to watch two movies during this flight.
You are given a list of integers that includes all the movie durations and also given the duration of the flight which is d in minutes.
Now, you need to pick two movies and the total duration of the two movies must be less than or equal to (d - 30min).
Find the pair of movies with the longest total duration. If multiple are found, return the pair with the longest movie.
Input
The input consists of two arguments:
movie_duration: a list of integers representing the duration of movies
d: an integer representing the duration of the flight
Output
return the movie pair.
Examples
Example 1
Input
movie_duration = [90, 85, 75, 60, 120, 150, 125]
d = 250
Output: [90, 125]
Explanation:
90min + 125min = 215 is the maximum sum within 220 (250min - 30min)