[Algorithm] Programmers :: 귤 고르기

https://school.programmers.co.kr/learn/courses/30/lessons/138476

프로그래머스

bool cmp(const pair<int, int>& a, const pair<int, int>& b)
{
    return a.second > b.second;
}
 
int solution(int k, vector<int> tangerine) 
{
    int answer = 0;
    map<int, int> m;
    map<int, bool> check;
 
    for (int i = 0; i < tangerine.size(); ++i)
    {
        m[tangerine[i]] += 1;
     }
 
    vector<pair<int, int>> nodes(m.begin(), m.end());
 
    sort(nodes.begin(), nodes.end(), cmp);
 
    for (int i = 0; i < nodes.size(); ++i)
    {
        if (!check[nodes[i].first])
        {
            ++answer;
            check[nodes[i].first] = true;
        }
 
        k -= nodes[i].second;
 
        if (k <= 0) break;
    }
 
    return answer;
}