简单排序 【简单 / 排序去重】

https://www.nowcoder.com/practice/139761e0b59a405786898b7f2db9423f?tpId=40&tqId=21425&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey

#include<cstdio>
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm> 
using namespace std;
bool hush[1000005]; 
int main(void)
{
    
    
	int n; cin>>n;
	int number;
	for(int i=0;i<n;i++) 
	{
    
    
		cin>>number;
		hush[number]=true;
	}
	for(int i=0;i<100005;i++)
	{
    
    
		if(hush[i])
		{
    
    
			cout<<i<<" ";
		}
	}
	return 0;
}

#include<cstdio>
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm> 
#include<set>
using namespace std;
set<int> st;
int main(void)
{
    
    
	int n; cin>>n;
	int number;
	for(int i=0;i<n;i++) 
	{
    
    
		cin>>number;
		st.insert(number);
	}
	for(auto op: st) cout<<op<<" ";
	return 0;
}

#include<cstdio>
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm> 
#include<set>
using namespace std;
set<int> st;
int main(void)
{
    
    
	int n; cin>>n;
	int number;
	for(int i=0;i<n;i++) 
	{
    
    
		cin>>number;
		st.insert(number);
	}
	set<int>::iterator it;
	for(it=st.begin();it!=st.end();it++)
	{
    
    
		cout<<*it<<" ";
	}
	return 0;
}