杭电oj 2019

从0开始到n交换排序

	#include<iostream>
	#include<cstdio>
	#include<cmath>
	#include<string>
	using namespace std;
	int main(){
		while(1){
		int n,m;
		int a[1000] = {0};
		cin >> n >> m;
		if(m == 0 && n == 0)break;
		int i;
		a[0] = m;
		for(i = 1; i <= n; i++){
			cin >> a[i];
		}
		int c;
		for(i = 0; i <n ;i++){
			if(a[i] > a[i+1]){
				c = a[i];
				a[i] = a[i+1];
				a[i+1] = c;
			}
		}
		cout << a[0] ;
		for(i = 1 ;i <= n ; i++)cout << ' ' << a[i] ;
		cout << endl; 
	}
		return 0;
	}