실패율

class Solution {
    public int[] solution(int N, int[] stages) {
        int count = 0;
        int remain = stages.length;
        double[] array = new double[N];
        int[] result = new int[N];
        
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < stages.length; j++){
                if(stages[j]==i){
                    count++;
                }
            }
            array[i] = (double) count / remain;
            remain = remain-count;
            count = 0;
        }
        //실패율이 높은 스테이지부터 내림차순 정렬
        
        
        //result 출력
        
    }
}

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