题解 | 明明的随机数

#include <stdio.h>

int main() {
    int n;
    scanf("%d",&n);
    int a[n];
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    for (int i=0; i<n; i++) {
        for(int j=1; j<n-i; j++){
            if (a[j-1]>a[j]) {
                int b;
                b = a[j-1];
                a[j-1] = a[j];
                a[j] = b;
            }else if (a[j-1] == a[j]) {
                for (int k=j-1; k<n; k++) {
                    a[k] = a[k+1];
                }
                n=n-1;
                j=j-1;
            }

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