Very simple solution ||| C++
```\nclass Solution {\npublic:\n    static bool cmp( string a,  string b){\n        if(a.length()==b.length()) return a>b;\n        return a.length()>b.length()
```\nclass Solution {\npublic:\n    static bool cmp( string a,  string b){\n        if(a.length()==b.length()) return a>b;\n        return a.length()>b.length();\n    }\n    string kthLargestNumber(vector<string>& nums, int k) {\n        sort(nums.begin(),nums.end(),cmp);\n        return nums[k-1];\n    }\n};
['C', 'Heap (Priority Queue)']