>>这不对吧，如何正确发表，蒟蒻求助。
by 0211qzh @ 2022-11-23 11:12:39
c```
#include <bits/stdc++.h>
c```
using namespace std;
c```
>int s[20],a[20];
c```
int n;
c```
int main(){
c```
cin>>n;
c```
for(int i=1;i<=n;i++){
c```
cin>>s[i];
c```
a[s[i]]++;
c```
}
c```
for(int i=0;i<=19;i++){
c```
if(a[i]==0) continue;
c```
for(int j=1;j<=a[i];j++){
c```
cout<<i<<' ';
c```
}
c```
}
c```
return 0;
c```
}
by 0211qzh @ 2022-11-23 11:19:53
[望丰展，使MD](https://www.luogu.com.cn/blog/luogu/how-to-use-markdown)
by Dovuq @ 2022-11-23 11:40:09
>>算了私信发给您吧
by 0211qzh @ 2022-11-23 13:12:56
```
#include<iostream>
using namespace std;
int a[10];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
int l=0;
for(int i=n-1;i>=1;i--)
{
if(a[i+1]<a[i])
{
l=i;
break;
}
}
if(!l)
{
cout<<"ERROR"<<endl;
return 0;
}
int num=0,k;
for(int i=l+1;i<=n;i++)
{
if(a[i]<a[l]&&a[i]>num)
{
num=a[i];
k=i;
}
}
a[k]=a[l];
a[l]=num;
for(int i=1;i<=l;i++)
{
cout<<a[i]<<" ";
}
for(int i=n;i>l;i--)
{
cout<<a[i]<<" ";
}
return 0;
}
```
这样时间复杂度低，并且对。
by xxc123 @ 2023-04-05 18:12:09
@[0211qzh](/user/714416)
by xxc123 @ 2023-04-05 18:32:27
@[xxc123](/user/787732) 不是，5月前的帖子你也回啊。
by 0211qzh @ 2023-04-05 21:36:47
@[xxc123](/user/787732) 不过，thx
by 0211qzh @ 2023-04-05 21:37:23
@[0211qzh](/user/714416)
我见啥回啥
by xxc123 @ 2023-04-05 21:37:55