C :

#include<stdio.h> 

int main(){ 
	int n,m,i,j,k,temp; 
	scanf("%d",&n);
	scanf("%d",&m);
	
	
	int a[m];
	for(i = 0;i < m;i++){
		scanf("%d",&a[i]);
	} 
	
	int b[m+1];
	for(i = 0;i < m;i++){
		b[i] = a[i]; 
	} 
	b[m] = n;

	for(i = 0;i < m;i++) {
		k = i; //假设最小的值下标为i 
		for(j = i + 1;j < m+1;j++){
			if(b[j] < b[k]){   //如果需要从大到小排序  < 换 > 
				k = j;
			}

		} 
		
		if(k != i){
			temp = b[i];
			b[i]  = b[k];
			b[k] = temp;
		}
	
	
	} 
	
	for(i = 0;i < m+1;i++){
		printf("%d ",b[i]);
	}	
	
	return 0; 
	  
} 

C++ :

#include <iostream>
#include <iomanip>
#include <cmath>
 
using namespace std;
 
int main(){
    int a[100],n,x,y,i;
    cin>>x>>n;
    for(i=0;i<n;i++){
    	cin>>a[i];
	}
	for(i=0;i<n;i++){
		if(a[i]<x){
			cout<<a[i]<<" ";
		}else{
		    cout<<x<<" ";
			break;	
		}
	}for(i=i;i<n;i++){
		cout<<a[i]<<" ";
	}
}

Python :

n=int(input())
m=int(input())
l1=list(map(int,input().split()))

for i in range(0,len(l1)):
    if n<=l1[i]:
        l1.insert(i,n)
        break
    if n>l1[m-1]:
        l1.append(n)
for i in l1:
    print(i,end=' ')