A content creator is taking on a challenge to get really good at

TikTok. Instead of regular activities, they decide to focus on a

playlist of $n$ TikTok reels.

To master TikTok, they set a goal to watch the reels a total of $m$

times. But they want to do this in the least amount of time

possible. Here's how it works:

First Time Watching: The creator must watch each reel in the

playlist completely the first time. The time it takes is

initialWatch$[$i$]+$ repeatWatch$[$i$]$ for the i$-$th reel.

Rewatching: After the first complete watch, they can rewatch

any reel in any order. For rewatching, they only spend

repeatWatch$[$i$]$ minutes per reel.

Sequential Viewing: When watching the playlist for the first

time, they must watch the reels in order, from the first to the

last.

Total Viewings: The total number of viewings $($including first$-$

time and rewatching$)$ across all reels must add up to $m.$

Optimization Goal: The creator aims to minimize the total time

spent watching the reels while fulfilling the above constraints.

This involves strategically planning which reels to repeat and

how often, given the reduced time for repeat viewings.

Function Description

Complete the function optimizeTikTokWatchTime in the editor

below.

optimizeTikTokWatchTime has the following parameter$($s$)$:

int $m$ : an integer denoting the total number of reel viewings

the creator aims to complete.

int initial Watch $n.$ an integer array denoting the minutes to

watch the $i-$th reel for the first time.

int repeatWatch$[$n$].$ an integer array denoting the minutes to

rewatch the $i-$th reel.

Returns

int: an integer denoting the minimum total minutes required

for the creator to reach their target $(m)$ count of reel viewings.