Solution with priority_queue
\n\n# Code\n\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n      priority_queue<pair<int,string>,vector<pair<int,strin
\n\n# Code\n```\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n      priority_queue<pair<int,string>,vector<pair<int,string>>,greater<pair<int,string>>> pq;\n        for(auto x : nums)\n            pq.push({x.length() , x});\n\n        while(1){\n            if(pq.size() == k)\n                break;\n            pq.pop();\n        }\n\n        return pq.top().second;\n    }\n};\n```
['Heap (Priority Queue)', 'C++']