#238 (div.2) A. Gravity Flip

1.题目描述：点击打开链接

2.解题思路：等价于对数组由小到大排序。

3.代码：

#define _CRT_SECURE_NO_WARNINGS#include<iostream>#include<algorithm>#include<string>#include<sstream>#include<set>#include<vector>#include<stack>#include<map>#include<queue>#include<deque>#include<cstdlib>#include<cstdio>#include<cstring>#include<cmath>#include<ctime>#include<functional>using namespace std;#define me(s) memset(s,0,sizeof(s))typedef long long ll;typedef unsigned int uint;typedef unsigned long long ull;typedef pair <int, int> P;const int N=100+10;int a[N];int main(){    int n;    while(~scanf("%d",&n))    {        for(int i=0;i<n;i++)            scanf("%d",&a[i]);        sort(a,a+n);        for(int i=0;i<n;i++)            printf("%d ",a[i]);        puts("");    }}