#238 (Div.2) A. Gravity Flip

1. Title Description: Click to open the link

2. Thinking: Equivalent to the array from small to large sort.

3. Code:

#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 ("");}    }

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

#238 (Div.2) A. Gravity Flip