Question

Enable Split Screen
P
You will be given an array A of length N, and an integer K. You have to partition
of the three group averages
ho
You need find the most optimal partition such that the final average is as close
It is given that the most optimal final average can be represented as a fractic
Notes:
• K<= A[1] + A[2] + ... + A[N] <= 100
nction Description​

Answer 1

Answer:

vfytuttutjrytfyghfcgygfyfhghfhryryrytyt7utytutg