先去重在sort
@[林则徐左宗棠](/space/show?uid=116774)
by 灵光一闪 @ 2019-01-27 15:07:02
啊不是,是
```先去重再sort```
by 灵光一闪 @ 2019-01-27 15:07:37
@[洛谷亿岁](/space/show?uid=122605) 不排序咋去重啊
by 林则徐左宗棠 @ 2019-01-27 15:26:13
```
#include<iostream>
using namespace std;
int main()
{
int N,M,z=0;
cin>>N;
M=N;
int a[N+1]={0};
for(int i=1;i<=N;i++) cin>>a[i];
for(int i=1;i<=N-1;i++)
{
for(int o=i;o+1<=N;o++)
{
if(a[i]==a[o+1])
{
M--;
a[o+1]=z;
}
z--;
}
}
cout<<M<<endl;
for(int o=1;o<=1001;o++)
{
for(int p=1;p<=N;p++)
{
if(a[p]==o)
cout<<a[p]<<" ";
}
}
return 0;//上古时期的蒟蒻代码
}
```
by 灵光一闪 @ 2019-01-27 15:30:53
开bool数组也可以
by 灵光一闪 @ 2019-01-27 15:37:55
@[林则徐左宗棠](/space/show?uid=116774)
by 灵光一闪 @ 2019-01-27 15:38:00