

K SubsequenceTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4320 Accepted Submission(s): 1089 Problem Description Master QWsin is dating with Sindar. And now they are in a restaurant, the restaurant has $n$ dishes in order. For each dish, it has a delicious value $ai$. However, they can only order $k$ times. QWsin and Sindar have a special ordering method, because they believe that by this way they can get maximum happiness value. Specifically, for each order, they will choose a $subsequence$ of dishes and in this $subsequence$, when $i < j$, the subsequence must satisfies $ai \leq aj$. After a round, they will get the sum of the $subsequence$ and they can't choose these dishes again. Now, master QWsin wants to know the maximum happiness value they can get but he thinks it's too easy, so he gives the problem to you. Can you answer his question? Input There are multiple test cases. The first line of the input contains an integer $T$, indicating the number of test cases. For each test case: First line contains two positive integers $n$ and $k$ which are separated by spaces. Second line contains $n$ positive integer $a1$,$a2$,$a3$...$an$ represent the delicious value of each dish. $1 \leq T \leq 5$ $1 \leq n \leq 2000$ $1 \leq k \leq 10$ $1 \leq ai \leq 1e5$ Output Only an integer represent the maximum happiness value they can get. Sample Input
Sample Output
Source  
