C++ Solution || 79% Faster || Min heap || Priority queue
Here numbers are given in string format and so we have to use a custom comparator in MinHeap. Add\nnumbers in the MinHeap and if MinHeap size > k then we pop nu
Here numbers are given in string format and so we have to use a custom comparator in MinHeap. Add\nnumbers in the MinHeap and if MinHeap size > k then we pop number from it. At last we find the Kth\nlargest number at the top.\n\n```\n#define ll long long\nclass Solution {\npublic:\n    \n    class comp {   \n    public:\n        bool operator()(string &a, string &b) {      // Like min heap first greater then, smaller nums on top\n            return a.length() > b.length() || (a.length()==b.length() && a>b);\n        }\n    };\n    \n    \n    string kthLargestNumber(vector<string>& nums, int k) {\n        \n        ll n= nums.size();\n        priority_queue<string, vector<string>, comp> pq;        // Min heap with custom comparator\n        \n        for(ll i=0; i<n; i++) {\n            pq.push(nums[i]);\n        }\n        \n        while(pq.size() > k) {\n            pq.pop();\n        }\n        \n        return pq.top();\n    }\n};\n```
['C', 'Heap (Priority Queue)']