 Maximum Profit
##### Submissions: 6614   Accuracy: 47.1%   Difficulty: Medium   Marks: 4

In stock market , a person buys a stock and sells it on some future date. Given the stock prices of N days in an form of an array A[ ] and a positive integer K, find out the maximum profit a person can make in atmost K transactions. A transaction is equivalent to (buying + selling) of a stock and new transaction can start only when the previous transaction has been completed.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains a positve integer K, denoting the number of transactions.The second line of each test case contains a positve integer N, denoting the length of the array A[ ].The third line of each test case contains a N space separated positive integers, denoting the prices of each day in the array A[ ].

Output:
Print out the maximum profit earned by the person.No profit will be equivalent to 0.

Constraints:
1 <= T <= 100
0 <   K <= 200
2 <= N <=500
0 <= A[ ] <= 1000

Examples:
Input:
3
2
6
10 22 5 75 65 80
3
4
20 580 420 900
1
5
100 90 80 50 25

Output:
87
1040
0

Explanation:
Output 1: Trader earns 87 as sum of 12 and 75  i.e. Buy at price 10, sell at 22, buy at  5 and sell at 80
Output 2: Trader earns 1040 as sum of 560 and 480 i.e. Buy at price 20, sell at 580, buy at 420 and sell at 900
Output 3: Trader cannot make any profit as selling price is decreasing day by day.Hence, it is not possible to earn anything.

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

Author: Rohan Malhotra

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.