[Programmers] (정렬) Lv 2. H-Index

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

프로그래머스

 

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> citations) {
    sort(citations.begin(), citations.end(), greater<int>()); // 내림차순 정렬

    // 인덱스가 값보다 크다면, 그 전 인덱스를 리턴
    for (int i = 0; i < citations.size(); ++i)
    {
        if (i + 1 > citations[i]) return i;
    }
    
    return citations.size();
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/0467cc3abfa8dfba1598fe3a5241099b1967a38f/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/42747.%E2%80%85H%EF%BC%8DIndex/H%EF%BC%8DIndex.cpp

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드