题目
思路
存放的时候先进性去重,最后排序即可
代码
#include<iostream>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
return a<b;
}
int main()
{
int n;
cin >> n;
int * arr = new int [n];
int length = 0;
for(int i = 0; i < n; i++)
{
int temp;
cin >> temp;
int flag = 1;
for(int j = 0; j < length; j++)
{
if(temp == arr[j])
{
flag = 0;
break;
}
}
if (flag)
{
arr[length++] = temp;
}
}
sort(arr,arr+length,cmp);
for(int i = 0; i < length - 1; i++)
{
cout << arr[i] <<" ";
}
cout << arr[length - 1];
}