1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int solution(vector<int> citations) {
    int answer = 0;

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

    int h = 0;

    for(int i=0; i< citations.size(); i++){
        ++h;

        if( i+1 >= citations[i]){
            if(i+1 > citations[i]) h = i;
            else h = i+1;
            break;
        }
    }

    answer = h;
    return answer;
}