杭电2019

#include <iostream>
using namespace std;

int main()
{
    int a[110] = {0};//已经排好的
    int n,m;
    while (cin>>n>>m && n||m)
    {
        a[0] = m;
        for (int i = 1; i <= n; i++)
        {
            cin>> a[i];
        }
        for (int i =0; i<n; i++)
        {
            for (int j=0; j<n-i; j++)
            {
                if (a[j+1]<a[j])
                {
                    int tem;
                    tem = a[j+1];
                    a[j+1] = a[j];
                    a[j] = tem;
                }
            }
        }
        cout<< a[0];
        for (int i =1;i<=n; i++)
        {
            cout<< ' '<< a[i];
        }
        cout<< endl;
    }
    return 0;
}

用冒泡排序，有待使用双数组倒换。