1204 최빈수 구하기

https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE

정렬, look-up table

#include <stdio.h>
 
typedef struct st_
{
    int num;
    int val;
}ST;
 
#define SWAP(x,y)    {ST temp; temp=x; x=y; y=temp;}
int T, tc;
ST a[100+10];
 
 
void init(void)
{
    int i;
 
    for (i = 0; i <= 100; i++)
    {
        a[i].val = 0;
    }
}
 
void input(void)
{
    int i;
    int score;
 
    scanf("%d", &tc);
    for (i = 1; i <= 1000; i++)
    {
        scanf("%d", &score);
        a[score].num = score;
        a[score].val++;        
    }
}
 
void sort(void)
{
    int i, j;
 
    for (i = 1; i <= 100; i++)
    {
        for (j = 0; j < i; j++)
        {
            if (a[j].val < a[i].val)
            {
                SWAP(a[i], a[j]);
            }
            else if (a[j].val == a[i].val && a[j].num < a[i].num)
            {
                SWAP(a[i], a[j]);
            }
        }
    }
}
 
void output(void)
{
    printf("#%d %d\n", tc, a[0].num);
}
 
int main(void)
{
    scanf("%d", &T);
    for (tc = 1; tc <= T; tc++)
    {
        init();
        input();
        sort();
        output();
    }
 
    return 0;
}