2019 Kakao Blind Recruitment - 실패율

코딩테스트 연습 - Level 1 - 실패율

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

#include <string>
#include <vector>
#include<algorithm>
using namespace std; 

bool compare(pair<int,double> a,pair<int,double> b){
    if(a.second==b.second)
    {
        return a.first<b.first;
    }
    
    else
    {
        return a.second>b.second;
    }
}

vector<int> solution(int N, vector<int> stages)
{
    int user=stages.size();
    double fails,cnt;
    vector<int> answer;
    vector<pair<int,double>>fail_rate;
    for(int i=1;i<=N;i++){
        fails=count(stages.begin(),stages.end(),i);
        if(user>=1)
        {
            cnt=fails/user;
        }
        
        else
        {
            cnt=0;
        }

        fail_rate.push_back(make_pair(i,cnt));
        user-=fails;

    }

    sort(fail_rate.begin(),fail_rate.end(),compare); 
    for(int i=0;i<fail_rate.size();i++)
    {
        answer.push_back(fail_rate[i].first);
    }

    return answer;
}