相当于重力是向右压的,实际上就相当于把木块从小到大排了一遍
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#define MAX 105
#define INF 0x3f3f3f3f
using namespace std;
int a[MAX];
int main() {
freopen("a.txt", "r", stdin);
freopen("b.txt", "w", stdout);
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
cout << a[0];
for (int i = 1; i < n; ++i) {
cout << " " << a[i];
}
cout << endl;
return 0;
}