C++ set去重排序

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>

using namespace std;
int main(){
    int N;
    while(cin>>N){//每个数组
        vector<int>tmp;
        int count=0;
        int a;
        while(count<N&&cin>>a){//将数组输入进去
            tmp.push_back(a);
            ++count;
        }
        set<int>s;
        for(auto& c:tmp){//利用set自带的去重排序
            s.insert(c);
        }
        for(auto it=s.begin();it!=s.end();++it){
            cout<<*it<<endl;
        }
    }
    return 0;
}