# Morty and his array

Posted: 5 Jul, 2021
Difficulty: Hard

## PROBLEM STATEMENT

#### Example : let ‘arr’ = [1,0,0] then the possible sub-arrays of ‘arr’ will be- {1}, {0}, {0}, {1,0}, {0,0}, {1,0,0}.

##### For Example
``````Let Arr[] = {1, 1, 1, 4, 1, 2, 4}, K=2

The given array can be split into two sub-arrays {1, 1, 1, 4}, {1, 2, 4}. The total cost will be for the first sub-array - 2+ 3(frequency of 1 is 3 in the first sub-array) + for the second sub-array - 2, Hence total cost is 7.
``````
##### Input Format :
``````The first line contains a single integer ‘T’ denoting the number of test cases to be run. Then the test cases follow.

The first line of each test case contains two integers, ‘N’ and ‘K’, denoting the length of the array and cost of each subarray, respectively.

The second line of the test case contains an array ‘Arr’ of ‘N’ integers.
``````
##### Output Format :
``````For each test case, print a single integer ‘ANS’ representing the minimum cost of splitting the array.

Output for each test case will be printed in a separate line.
``````
##### Note :
``````You are not required to print anything; it has already been taken care of. Just implement the function and return the answer.
``````
##### Constraints :
``````1 <= T <= 10
1 <= N <= 500
1 <= K <= 500
1 <= Arr[i] <= 500

Time limit: 1 sec
`````` Approach 1

The basic idea is to generate all the possible subarrays and find the cost of every possible split and then returning the minimum cost from all of them.

The steps are as follows:

1. Recursively go through every possible split of the array Arr.
2. Store all the subarrays of one split into a vector<vector<int>> split.
3. Now go through every subarray of that split and find the frequency of every element in that subarray and calculate the cost of that split.
4. Return the minimum value from all of the splits.