C :

#include<stdio.h>
int main()
{
	int i, k, j, t, a[10];
	for(i = 0; i < 9; i++)
		scanf("%d", &a[i]);
	scanf("%d", &k);
	for(i = 0; i < 9; i++)
		if(k < a[i])
			break;
		for(j = i; j < 10; j++)
		{
			t = a[j];
			a[j] = k;
			k = t;
		}
		for(i = 0; i < 10; i++)
			printf("%d\n", a[i]);
		return 0;
}

C++ :

#include<stdio.h>
int main()
{
	int i, k, j, t, a[10];
	for(i = 0; i < 9; i++)
		scanf("%d", &a[i]);
	scanf("%d", &k);
	for(i = 0; i < 9; i++)
		if(k < a[i])
			break;
		for(j = i; j < 10; j++)
		{
			t = a[j];
			a[j] = k;
			k = t;
		}
		for(i = 0; i < 10; i++)
			printf("%d\n", a[i]);
		return 0;
}

Pascal :

const n=9;
var a:array[1..n+1]of longint;
    i,t,j:longint;
begin
  for i:=1 to n do
  read(a[i]);
  readln;
  read(a[n+1]);
  for i:=1 to n-1+1 do
   for j:=i+1 to n+1 do
   if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t;end;
  for i:=1 to n+1 do
  writeln(a[i]);
end.