题解 | 明明的随机数

//
// Created by gs on 2026/3/4.
//

// HJ3 明明的随机数

#include <stdio.h>

int main() {
    int n, a;
    short buf[1001];
    short sort[1001];
    int i=0;
    int index = 0;
    while (scanf("%d", &a) != EOF) { // 注意 while 处理多个 case
        if(i== 0){
            n = a;
        }else{
            buf[i-1] = (short)a;
        }
        if(i == n){
            break;
        }
        i++;
    }


    for(int i=0; i<n; i++){
        short min=501;
        short min_index = 0;
        for(int j=0; j<n; j++){
            if(buf[j] < min){
                min = buf[j];
                min_index = j;
            }
        }
        buf[min_index] = 501;

        if(index == 0){
            sort[index] = min;
            index++;
        } else{
            if(sort[index-1] != min){
                sort[index] = min;
                index++;
            }
        }
    }

    for(int i=0; i< index; i++){
        printf("%d\n", sort[i]);
    }

    return 0;
}