C++ solution without using comparator, MinHeap
Our main concern is strings are stored in Lexicographic order i.e., as saved in a dictionary.  For eg. we get, "136" >"1205" as per "lexicographic ordering."\nT
Our main concern is strings are stored in Lexicographic order i.e., as saved in a dictionary.  For eg. we get, "136" >"1205" as per "lexicographic ordering."\nTo overcome this, we store- pair of length of string and the string itself as items in our MinHeap as number string of greater length is always larger than a smaller one and hence, we decide our smaller/larger for unequal length number strings.\n```\nstring kthLargestNumber(vector<string>& nums, int k) {\n        priority_queue<pair<int, string>, vector<pair<int, string>>, greater<pair<int, string>>> pq;\n        for(auto it: nums){\n            int len=it.size();\n            pq.push({len, it});\n            if(pq.size()>k) pq.pop();\n        }\n        return pq.top().second;\n}
['C']