冒泡排序get！
#include <iostream>
using namespace std;
int a[100001] = { 0 };
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; cin >> a[i], ++i);
for (int i = 1; i <= n; cout<< a[i]<<" ", ++i);
for (int i = 1; i <= n; ++i) {
for (int u = 1; u <= n - i; u++) {
if (a[u] > a[u + 1]) swap(a[u], a[u + 1]);
}
}
cout << endl;
for (int i = 1; i <= n; cout << a[i] << " ", ++i);
}