插入排序吸一口氧竟然能过

#include<iostream>
using namespace std;
int n, a[1000005];
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i];
	for (int i = 2; i <= n; i++) {
		int cur = i, ans = a[i];
		for (int j = 1; j < i; j++) {
			if (a[j] > a[i]) {
				cur = j;
				break;
			}
		}
		for (int j = i; j >= cur; j--) {
			a[j] = a[j - 1];
		}
		a[cur] = ans;
	}
	for (int i = 1; i <= n; i++)cout << a[i] << " ";
	return 0;
}