Codeforces Round #238 (Div. 2) A Gravity Flip

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int i,j,k,m,n,a[105];
	while(cin>>k)
	{
		for(i=0;i<k;i++)
			cin>>a[i];
		sort(a,a+k);
		cout<<a[0];
		for(i=1;i<k;i++)
			cout<<" "<<a[i];
		cout<<endl;
	}
}

看明白其实就是排序而已