题解 | #排序#

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

const int MAXN = 100 + 10;

int arr[MAXN];

int main() {
	int n;
	while(scanf("%d",&n) != EOF){
		for(int i = 0; i < n; ++i){
			scanf("%d",&arr[i]);
		}
		sort(arr,arr + n);    //数组名字既代表数组又代表数组的起始地址
		for(int i = 0; i < n; ++i){
			printf("%d ",arr[i]);
		}
		printf("\n");
	}
	return 0;
}