leetcode 169. Majority ElementEasy

class Solution {
public:
    static bool cmp(pair<int, int>& a, pair<int, int>& b)
    {
        return a.second < b.second;
    }

    int majorityElement(vector<int>& nums) {
        int res;
       unordered_map<int,int> map;

       for(int i=0;i<nums.size();i++)
        map[nums[i]]++;
        vector<pair<int, int>> v(map.begin(), map.end()); 
        sort(v.rbegin(), v.rend(), cmp);
        res = v[0].first;
        return res;
    }
};

map 으로 담아준뒤 , vector로 정렬해서 첫번째 값을 반환했다.
https://leetcode.com/problems/majority-element/?envType=study-plan&id=data-structure-ii