[C] 코드업 4012: 석차계산 - 구조체

원본 문제

석차 계산

---

#include <stdio.h>

struct group
{
    int idx;
    int score;
    int grade;
};

int main() {
    struct group student[200];
    
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; i++) {
        scanf("%d", &student[i].score);
        student[i].idx = i;
    }
    
    // Bubble Sort (내림차순 정렬)
    struct group swp;
    for (int i=n-1; i>0; i--){
        for (int j=0; j<i; j++){
            if(student[j].score < student[j+1].score){
                swp = student[j];
                student[j] = student[j+1];
                student[j+1] = swp;
            }
        }
    }
    
    // 등수 계산
    int level = 1; // cnt 느낌
    for (int i=0; i<n; i++){
        if (i>0 && student[i-1].score == student[i].score){
            student[i].grade = level;
        }
        else {
            // level = level+1;
            level = i+1;
            student[i].grade = level;
        }
    }
    
    // 출력
    for (int i=0; i<n; i++){
        for (int j=0; j<n; j++){
            if (student[j].idx == i){
                printf("%d %d\n", student[j].score, student[j].grade);
            }
        }
    }
    return 0;
}