题解 | #明明的随机数#

#include <iostream>
#include <queue>
#include <stack>
#include <vector>

using namespace std;

int main(){
    int N = 0;
    cin>>N;
    
    priority_queue<int> pq;
    
    for(int i = 0; i < N; i++){
        int num = 0;
        cin>>num;
        pq.push(num);
    }
    
    stack<int> st;
    st.push(pq.top());
    pq.pop();
    while(!pq.empty()){
        if(st.top() != pq.top()){
            st.push(pq.top());
        }
        pq.pop();
    }
    
    vector<int> res;
    while(!st.empty()){
        res.push_back(st.top());
        st.pop();
    }
    
    for(int i = 0; i < res.size(); i++){
        cout << res[i] << endl;
    }
    
    return 0;
}