본문 바로가기

코테 문풀/[Algorithm]프로그래머스(Programmers) 풀이

[Algorithm] 프로그래머스 - H-Index(level 2)

#include <string>
#include <vector>
#include <iostream>
#include <stdio.h>
#include <algorithm>


#define endl '\n'
using namespace std;
bool cmp(int a, int b){
    if(a!=b) return a>b;
}
int solution(vector<int> citations) {
    int answer = 0;
    sort(citations.begin(), citations.end(), cmp);
        
    
    for(int i = 0;i<citations.size();i++)
    {
        if(i+1 ==citations[i])
        {
            return citations[i];
        }
        else if(i+1 >citations[i])
            return i;
            
    }
    
    return citations.size();
}