题解 | #明明的随机数#

#include <iostream>
using namespace std;
const int N = 1010;
int n;
int a[N];
int flag = 0;
void comp(int c, int b, int q) {

    if (c == b) {
        for (q; q < n - 1; q++)
            a[q] = a[q + 1];
        flag++;
        comp(c, b, q);
    }
}
void shunxu(int a[]) {
    int index;
    for (int j = 0; j < n ; j++)
        for (int i = n ; i > j; i--)
            if (a[i] > a[i - 1])
            {
                index = a[i - 1];
                a[i - 1] = a[i];
                a[i] = index;
            }

}
int main() {
    cin >> n;
    int j = 0;
    while (j < n) {
        cin >> a[j];
        ++j;
    }
        shunxu(a);
            for(int i=0;i<n-1;i++)
        for(int j=i+1;j<n;j++)
        {
            if(a[i]==a[j])
            a[j]=0;
        }
    
    for (int i = n -1 ; i >= 0; i--) {
        if(a[i]!=0)
        cout << a[i] << endl;
    }
}