题解 | #明明的随机数#

#include <iostream>
#include <unordered_set>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    int x;
    vector<int> vec;
    while(N--){
        cin>>x;
        vec.push_back(x);
    }
    unordered_set<int> set;
    vector<int> result;
    sort(vec.begin(),vec.end());
    for (auto n : vec){
        if (set.find(n) != set.end())
            continue;
        set.insert(n);
        result.push_back(n);
    }
    for (int i = 0; i < result.size(); i++)
        cout<<result[i]<<endl;
}
// 64 位输出请用 printf("%lld")