数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44818 Accepted Submission(s): 19438
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
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
int s[110];
int main()
{
int n, m, t, i, f;
while((scanf("%d %d", &n, &m)) != EOF)
{
if(n==0 && m==0) break;
f = 0;
for(i = 0; i < n; i++)
{
scanf("%d", &t);
if(t < m) printf("%d", t);
else if(m <= t && f == 0)
{
printf("%d %d", m, t);
f = 1;
}
else printf("%d", t);
if(f == 0) printf(" ");
else if(f == 1 && i+1 != n) printf(" ");
}
printf("\n");
}
return 0;
}
#include<stdio.h>
int main()
{
int s[110], i, n, m;
while((scanf("%d %d", &n, &m)) != EOF && (n||m))
{
for(i = 0; i < n; i++)
scanf("%d", &s[i]);
for(i = n; i >= 0 && s[i-1] > m; i--)
s[i] = s[i-1];
s[i] = m;
for(i = 0; i <= n; i++)
printf("%d%c", s[i], (i!=n? ' ':'\n'));
}
return 0;
}