c++ leetcode top k frequent words (sort and custom comparison) solution

code >>

using namespace std;
 
typedef struct _Point {
    int second_int;
    string first_string;
} Point;
 
bool comp(const Point& p1, const Point& p2)
{
    if (p1.second_int > p2.second_int)
    {
        return true;
    }
    else if (p1.second_int == p2.second_int)
    {
        return p1.first_string < p2.first_string;
    }
    else
        return false;
}
 
 
class Solution {
public:
    vector<string> topKFrequent(vector<string>& words, int k) {
        unordered_map<string, int> hashmap;
        vector<Point> countArray;
        vector<string> ansVector;
        int wSize = (int)words.size();
        for (int i = 0; i < wSize; i++)
        {
            if (hashmap.count(words[i]) == 0)
                hashmap[words[i]] = 1;
            else
                hashmap[words[i]] = hashmap[words[i]] + 1;
        }
        for (const auto& ele : hashmap)
        {
            Point eleInput;
            eleInput.first_string = ele.first;
            eleInput.second_int = ele.second;
            countArray.emplace_back(eleInput);
        }
        sort(countArray.begin(), countArray.end(), comp);
 
        for (int i = 0; i < k; i++)
        {
            ansVector.push_back(countArray[i].first_string);
        }
        
        return ansVector;
    }
};