 Maximum Sum Subsequence of length k
##### Submissions: 2521   Accuracy: 15.41%   Difficulty: Medium   Marks: 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.

INPUT
The first line contains an integer 'T' denoting the number of testcases. Then 'T' test cases follows. Each test case consists of two line containing two space separated integers 'N' and 'K' denoting the size of the array and length of the subsequence.

OUTPUT
Print the maximum possible sum. If their is no subsequence of length K print "-1".

CONSTRAINTS
1 <= T <= 100
1 <= N <= 100
1 <= a[i] <= 10^5
1 <= k <=100

Example
Input
1
8 3
8 5 9 10 5 6 19 8

Output
38

Explanation
In sample input Possible Increasing subsequence of Length 3 with maximum possible sum is 9 10 19

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Kannu Mittal
Author: vaibhav2992

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.