Approach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n        \n    struct comparator\n    {\n        bool operator () (string& a, string& b)\n        {\n            if(a.size() == b.size())\n                return a > b;\n            else\n                return a.size() > b.size();\n        }\n    };\n    \n    string kthLargestNumber(vector<string>& nums, int k) {\n        \n        int n = nums.size();\n        priority_queue<string, vector<string>, comparator> pq;\n        \n        for(int i = 0; i < n; i++)\n        {\n            if(i < k)\n            {\n                pq.push(nums[i]);\n            }\n            else\n            {\n                pq.push(nums[i]);\n                \n                pq.pop();\n            }\n        }\n        \n        return pq.top();\n    }\n};\n```
['C++']