Given a string, construct a new string by rearranging the original string and deleting characters as needed. Return the alphabetically largest string that can be constructed respecting a limit as to how many consecutive characters can be the same. Example:
s='bacc'
k=2
The largest string, alphabetically, is 'cccba' but it is not allowed because it uses the character 'c' more than 2 times consecutively. Therefore, the answer is 'ccbca'.
Function Description
Complete the function getLargestString in the editor below.
getLargestString has the following parameters:
string s[n]: the original string
int k: the maximum number of identical consecutive characters the new string can have
Returns:
string: the alphabetically largest string that can be constructed that has no more than k identical consecutive characters
Constraints
- 1<= n <= 10^5
- 1<= k <= 10^3
- The string s contains only lowercase English letters.
Input Format For Custom Testing
Sample Case 0
Sample Input
STDIN Function

zzzazz --> string s = 'zzzazz'
2 --> k = 2
Sample Output
zzazz
Explanation
One 'z' must be removed so that no more than 2 consecutive characters are the same.