c++ leetcode top-k frequent elements O(nlogn) solution

code >>

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