航电2019数列有序

数列有序!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 67237    Accepted Submission(s): 28470

Problem Description

有n(n<=100)个整数，已经按照从小到大顺序排列好，现在另外给一个整数x，请将该数插入到序列中，并使新的序列仍然有序。

 

Input

输入数据包含多个测试实例，每组数据由两行组成，第一行是n和m，第二行是已经有序的n个数的数列。n和m同时为0标示输入数据的结束，本行不做处理。

 

Output

对于每个测试实例，输出插入新的元素后的数列。

 

Sample Input

  
  

   
   3 3
1 2 4
0 0
  
  

 

Sample Output

  
  

   
   1 2 3 4
  
  

 

Author

lcy

 

Source

C语言程序设计练习（三）

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2021 2020 2022 2023 2024 

 

<strong><span style="font-size:24px;">#include<stdio.h>
int main()
{
<span style="white-space:pre">	</span>int m,n,a[110],i,t;
<span style="white-space:pre">	</span>while(~scanf("%d %d",&n,&m)&&(m!=0||n!=0))
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>for(i=0;i<n;i++)
<span style="white-space:pre">		</span>scanf("%d",&a[i]);
<span style="white-space:pre">		</span>for(i=0;i<n;i++)
<span style="white-space:pre">		</span>{
<span style="white-space:pre">			</span>if(m<a[i])
<span style="white-space:pre">		</span>     </span><span style="font-size:32px;"> <span style="background-color: rgb(255, 0, 0);">{              ||忘了加大括号一直出错，以后得注意
<span style="white-space: pre;">			</span>t=i;
<span style="white-space: pre;">			</span>break;}</span></span><span style="font-size:24px;">
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">}
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">if(i==n)
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">a[n]=m;
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">else
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">{
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">for(i=n-1;i>=t;i--)
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">a[i+1]=a[i];
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">a[t]=m;}
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">printf("%d",a[0]);
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">for(i=1;i<=n;i++)
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">printf(" %d",a[i]);
</span><span style="font-size:24px; white-space: pre;">		</span><span style="font-size:24px;">printf("\n");}
</span><span style="font-size:24px; white-space: pre;">	</span><span style="font-size:24px;">return 0;
}
</span></strong>