数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 45174 Accepted Submission(s): 19593
Problem Description
有n(n<=100)个整数,已经按照从小到大顺序排列好,现在另外给一个整数x,请将该数插入到序列中,并使新的序列仍然有序。
Input
输入数据包含多个测试实例,每组数据由两行组成,第一行是n和m,第二行是已经有序的n个数的数列。n和m同时为0标示输入数据的结束,本行不做处理。
Output
对于每个测试实例,输出插入新的元素后的数列。
Sample Input
3 31 2 40 0
Sample Output
1 2 3 4
-----------------------------------------------------------------------------------------------------------------------
方法一:
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,m,i,j,p,s[105];
while(scanf("%d%d",&n,&m)!=EOF)
{
if(m==0&&n==0)
break;
for(i = 0;i<n;i++)
scanf("%d",&s[i]);
for(i = 0;i<n; i++)
{
if(m<=s[i])
{
p = i;
break;
}
}
for(j = n-1;j >p-1;j-- )
s[j+1] = s[j];
s[p] = m;
printf("%d",s[0]);
for(i = 1;i<=n;i++)
printf(" %d",s[i]);
printf("\n");
}
return 0;
}
#include <stdlib.h>
int main()
{
int n,m,i,j,p,s[105];
while(scanf("%d%d",&n,&m)!=EOF)
{
if(m==0&&n==0)
break;
for(i = 0;i<n;i++)
scanf("%d",&s[i]);
for(i = 0;i<n; i++)
{
if(m<=s[i])
{
p = i;
break;
}
}
for(j = n-1;j >p-1;j-- )
s[j+1] = s[j];
s[p] = m;
printf("%d",s[0]);
for(i = 1;i<=n;i++)
printf(" %d",s[i]);
printf("\n");
}
return 0;
}