실패율 - 2019 KAKAO BLIND RECRUITMENT

https://programmers.co.kr/learn/courses/30/lessons/42889

프로그래머스

문제에 제시된 제한 사항

입출력 예시

#include <string>
#include <vector>
#include <algorithm>
 
using namespace std;
 
float fail_rate(vector<int> stages, int cmp) {
    float not_yet = 0;
    float arrival = 0;
    
    for (int i = 0; i < stages.size(); i++) {
        if (stages[i] > cmp) {
            arrival++;
        }
        else if (stages[i] == cmp) {
            arrival++;
            not_yet++;
        }
    }
    if (arrival == 0) {
        return 0;
    }
    return not_yet / arrival;
}
 
vector<int> solution(int N, vector<int> stages) {
    vector<int> answer;
    vector<float> fail;
    for (int i = 1; i < N+1; i++) {
        fail.push_back(fail_rate(stages, i));
    }
    for (int i = 1; i < N + 1; i++) {
        vector<float>::iterator max_iter = max_element(fail.begin(), fail.end());
        int max_idx = max_iter - fail.begin();
        answer.push_back(max_idx+1);
        fail[max_idx] = -1;
    }
    return answer;
}