C++ | Sorting | Fast & Simple
\nclass Solution {\npublic:\n    \n   static bool comp(string& s1,string& s2){\n        if(s1.length()==s2.length()){\n            for(int i=0;i<s1.length();i++
```\nclass Solution {\npublic:\n    \n   static bool comp(string& s1,string& s2){\n        if(s1.length()==s2.length()){\n            for(int i=0;i<s1.length();i++){\n                if(s1[i]==s2[i]) continue;\n                else return s1[i]>s2[i];\n            }\n        }\n        return s1.length()>s2.length();\n    }\n     \n    string kthLargestNumber(vector<string>& nums, int k) {\n        sort(nums.begin(),nums.end(),comp);\n        return nums[k-1];\n    }\n};\n\n```\nPlease upvote if you found this useful :)
['C', 'Sorting', 'C++']