c++ solution using sorting (comparator)
\nclass Solution {\npublic:\n    static bool cmp(string &a,string &b)\n    {\n        if(a.size()==b.size())\n        {\n            return a<b;\n        }\n   
```\nclass Solution {\npublic:\n    static bool cmp(string &a,string &b)\n    {\n        if(a.size()==b.size())\n        {\n            return a<b;\n        }\n        return a.size()<b.size();\n    }\n    string kthLargestNumber(vector<string>& nums, int k) \n    {\n        sort(nums.begin(),nums.end(),cmp);\n        int n=nums.size();\n        return nums[n-k];\n    }\n};\n```
['C', 'Sorting', 'C++']