Simple C++ Using Priority Queue Custom Comparator || Explanation || O(nlogn)
The question is same as find k\'th largest number using min heap\nWe can\'t simply convert string into integers for comparison as size of string may be greater 
**The question is same as find k\'th largest number using min heap**\nWe can\'t simply convert string into integers for comparison as size of string may be greater than even `long long int`. So we use min heap with custom comparator.\n\nWe use string comparison technique:-\n1) Check for length of string\n2) If length is same find the first greater character and return the string with first largest character\n\n<iframe src="https://leetcode.com/playground/6nYvctMM/shared" frameBorder="0" width="900" height="500"></iframe>
[]