HDOJ2019

来源:互联网 发布:mac 充电iphone 好快 编辑:程序博客网 时间:2024/06/06 08:38
#include <iostream> 
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <math.h>


using namespace std;
#define N 110


int a[N];


int main()
{
int n, m;
while (cin >> n >> m, n, m)
{
int i;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++)
if (m >= a[i] && m < a[i + 1]) break;
for (int j = n; j > i + 1; j--)
a[j] = a[j - 1];
a[i+1] = m;
for (int i = 0; i < n; i++) 
cout << a[i] << " ";
cout << a[n] << endl;
}
}

原创粉丝点击