Maximum Sum Subsequence of length k
Medium Accuracy: 22.49% Submissions: 594 Points: 4

Given an array sequence [A1 , A2 ...An], the task is to find the maximum possible sum of increasing subsequence S of length K such that Si1<=Si2<=Si3.........<=Sin.

Example 1:

N = 8 K = 3
A[] = {8 5 9 10 5 6 19 8}
Output: 38
Possible increasing subsequence of
length 3 with maximum possible
sum is 9 10 9.

Example 2:

N = 2,K = 2
A[] = {10 5}
Output: -1
Can't make any increasing subsequence 
of length 2.

Your Task:
You don't need to read or print anything. Your task is to complete the function max_sum() which takes sequence A as the first parameter and K as the second parameter and returns the maximum possible sum of K-length increasing subsequnece. If not possible return -1.

Expected Time Complexity: O(max(Ai) * n * log(max(Ai)))
Expected Space Complexity: O(max(Ai))

1 <= n <= 100
1 <= Ai <= 100000



to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Maximum Sum Subsequence of length k

Output Window