#include <iostream>
#include<algorithm>
using namespace std;
bool compare(int a,int b)
{
return a<b; //升序排列,如果改为return a>b,则为降序
}
int main(){
int n;
int a[201] = {};int k;
int temp;
cin>>n;
for(int i = 0; i <n; i++)
{
cin>>a[i];
}
sort(a,a+n,compare);
for(int i = 0; i < n; i++)
cout<<a[i]<<" ";
return 0;
}
原文:https://www.cnblogs.com/chencheng29/p/10461645.html