✅✅Easiest and Smallest C++ Solution using comparator ✈️✈️✈️✈️✈️
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    bool static comp(string s1, string s2){\n        int n1 = s1.length();\n        int n2 = s2.length();\n        if(n1 == n2){\n            return s1>s2;\n        }\n        return n1>n2;\n    }\n    string kthLargestNumber(vector<string>& nums, int k) {\n        sort(nums.begin(), nums.end(),comp);\n        for(int i=0; i<nums.size(); i++){\n            if(i == k-1) return nums[i];\n        }\n        return "-1";\n    }\n};\n```
['Sorting', 'C++']