HDU ACM 11 2019 数列有序！

#include 
using namespace std;
const int Yi = 100;
int main()
{
	int n, m, x;
	int i = 0;
	int Lu[Yi];
	while (cin >> n >> m && (n != 0 && m != 0))
	{
		for ( i = 0; i < n; i++)
			cin >> Lu[i];
		Lu[n] = m;
		for (int j = 1; j < i + 1; j++)
		{
			int key = Lu[j];
			x = j - 1;
			while (x >= 0 && Lu[x] > key)
			{
				Lu[x + 1] = Lu[x];
				x--;
			}
			Lu[x + 1] = key;
		}
		cout << Lu[0];
		for (i = 1; i < n + 1; i++)
			cout << ' ' << Lu[i];
		cout << endl;
	}
	return 0;
}