Maximum Learning

Problem Statement

Maximum Learning Maximum Learning Problem Description An e-book provider offers a variety of programming articles, each with a distinct intellectual value. Readers earn points equal to an article's intellectual value for each article read twice. Given a list of articles with their page lengths, intellectual value coefficients, and a daily page limit, find the maximum achievable intellectual value in one day. Complete the function maximumLearning which has the following parameters: int iv[n] : each article's intellectual value int articles[n] : each article's page length int p : the number of pages that can be read in one day The function should return an integer value representing the maximum achievable intellectual value in one day of reading. Examples Example 1: Input: iv = [2, 4, 4, 5] articles = [2, 2, 3, 4] p = 15 Output: 10 Explanation: There are n = 4 articles with lengths [2, 2, 3, 4] and intellectual values [2, 4, 4, 5]. The maximum pages that can be read per day is p = 15. Th