Easy ✅|| C++|| Min Heap || priority queue
Complexity\n- Time complexity:O(nlogk)\n- Space complexity:O(k)\n\n# Code\n\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k)
# Complexity\n- Time complexity:O(nlogk)\n- Space complexity:O(k)\n\n# Code\n```\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n//I have used pair<int,string> in min heap priority queue.\n\n// int in pair<int,string> is for length of string.\n\n// Elements will be stored in lexicographical order when length of elements will be same else elements will be stored on the basis of length of string.\n\n        priority_queue<pair<int,string>,vector<pair<int,string>>,greater<pair<int,string>>>minH;\n\n        for(int i=0;i<nums.size();i++){\n           minH.push({nums[i].size(), nums[i]});\n           if(minH.size()>k){\n               minH.pop();\n           }\n        }\n        return minH.top().second;\n    }\n};\n```
['Heap (Priority Queue)', 'C++']