C++ min heap solution
cpp\nclass Solution\n{\npublic:\n  string kthLargestNumber(vector<string> &nums, int k)\n  {\n    auto myComp = [](string s1, string s2) {\n      if (s1.length(
```cpp\nclass Solution\n{\npublic:\n  string kthLargestNumber(vector<string> &nums, int k)\n  {\n    auto myComp = [](string s1, string s2) {\n      if (s1.length() == s2.length())\n      {\n        return s1 > s2;\n      }\n      return s1.length() > s2.length();\n    };\n    priority_queue<string, vector<string>, decltype(myComp)> pq(myComp); // min heap\n    for (const auto &num : nums)\n    {\n      pq.push(num);\n      if (pq.size() > k)\n      {\n        pq.pop();\n      }\n    }\n    return pq.top();\n  }\n};\n```
[]