(Solved): 4. Maximizing Task Priority ByteDance is working on a new algorithm that operates on a special C ...

4. Maximizing Task Priority
ByteDance is working on a new algorithm that
operates on a special CPU that can handle n types
of tasks, and the priority of the th task is
represented by the array priority[i]. The CPU will
run for y seconds and you can choose any task to
perform which follows the given conditions:
• In each second, you user can choose to perform
any available task from the n types (if there are any
tasks to perform).
• It is allowed to perform multiple tasks of the same
type within the given time frame, but there is a time
constraint that there must be at least x seconds
between any two consecutive tasks of the same
type.
• It is not allowed to perform more than one task at
any second.
Given n tasks, an array priority, and an integer x
and y, find the maximum possible sum of the
priority of tasks performed during the y seconds.
What will the Python code be for this question?

Given, $n=3$, priority $=[3,1,2],x=5$, and $y=7$. can get is equal to 11 . We performed the task of the $1^{\text{st }}$ type then till the second 5 we cannot perform the task of the $1^{\text{st }}$ type again because of the time constraint $x$, from the 6 th second we can perform the task of the $1^{\text{st }}$ type. The same applies to the task of the $3^{\text{rd }}$ type as we once performed it in the $2^{\text{nd }}$ second, and then till the $6^{\text{th }}$ second, we Complete the function maximumPrioritySum in the editor below. maximumPrioritySum has the following parameters: - int priority[n]: an array of integers representing the priorities of each task. - int $x$. an integer denoting the minimum time constraint between every 2 tasks of the same type to be performed. - int $y$. an integer denoting the number of seconds the CPU will run. Returns int: the maximum possible sum of the priority of tasks performed during the $y$ seconds. Constraints - $1?n?10^5$ $1?$ priority[i] $?10^5$ - $1?x?10^9$ - $1?y?10^9$