Efficient Study

Problem Statement

Efficient Study 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. Function Description Complete the function maximumLearning in the editor with the following parameter(s): int iv[] : each article's intellectual value int articles[] : each article's page length int p : the number of pages that can be read in one day Returns int : integer value representing the maximum achievable intellectual value in one day of reading Examples Example 1: Input: iv = [3, 2, 2] articles = [3, 2, 2] p = 9 Output: 4 Explanation: There are n = 3 articles with articles = [3, 2, 2] pages and corresponding intellectual values iv = [3, 2, 2] . A maximum of p = 9 pages can be read in a day.