1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

#include<stdio.h>
#include<math.h>
#include<string.h>
int main() {
    int i,n,m,k,t;
    int shulie[110];
    while(scanf("%d %d",&n,&m),n!=0||m!=0) {
        memset(shulie,0,sizeof(shulie));
        for(i=0; i<n; i++)
            scanf("%d",&shulie[i]);
        for(i=0,k=0; i<n; i++) {
            if(m>shulie[i])
                k++;
        }
        if(k==0) {
            for(i=0; i<=n; i++) {
                t=shulie[i];
                shulie[i]=m;
                m=t;
            }
        } else if (k==n)
            shulie[n]=m;
        else {
            for(i=k; i<=n; i++) {
                t=shulie[i];
                shulie[i]=m;
                m=t;
            }
        }
        for(i=0; i<=n; i++) {
            printf("%d",shulie[i]);
            if(i!=n)
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}