题解 | Simple Sorting

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    while (cin >> N) {
        int* num = new int[N];
        for (int i = 0; i < N; i++) cin >> num[i];
        sort(num, num + N);
        cout << num[0] << " ";
        int m = num[0];
        for (int i = 1; i < N; i++) {
            if (num[i] > m) {
                cout << num[i] << " ";
                m = num[i];
            } else continue;
        }
        cout << "\n";
    }
    return 0;
}