#include <iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
vector<int> v;
int n,m;
cin >> n;
while (n--&&cin >> m)
{
v.push_back(m);
}
sort(v.begin(), v.end());
auto end_unique = unique(v.begin(), v.end());
v.erase(end_unique, v.end());
for (auto c : v)
cout << c << endl;
return 0;
}
数组排序
最新推荐文章于 2022-11-11 19:22:43 发布