C :

#include<stdio.h>
int main(){
int n,i,k;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
	scanf("%d",&a[i]);
	if(i==0){
		k=0;
	}else if(a[k]>a[i]){
	k=i;
	}
}
	for(i=k+1;i<=n-1;i++){
		a[i-1]=a[i];
	}	
for(i=0;i<n-1;i++){
		printf("%d ",a[i]);
}
return 0;
}

C++ :

#include <iostream>
using namespace std;

int main(){
	int i,n,x,y;
	int a[11];
	cin>>n;
	//读入数组元素
	for(i = 0;i < n;i++){
		cin>>a[i];
	} 
	
	int m = 0;
	for(i = 1;i < n;i++){
		if(a[i] < a[m]){
			m = i;
		}
	}
	
	for(i = m;i <= n - 2;i++){
		a[i] = a[i + 1];
	}
	
	for(i = 0;i < n - 1;i++){
		cout<<a[i]<<" ";
	} 
	
	
}

Java :

import java.util.Scanner;

public class Main {
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int[] a=new int[n];
		for(int i=0;i<n;i++){
			a[i]=sc.nextInt();
		}
		int minnum=a[0],minpo=0;
		for(int i=0;i<n;i++){
			if(a[i]<minnum){
				minpo=i;
			}
		}
		int[] b=new int[n-1];
		for(int i=0;i<minpo;i++){
			b[i]=a[i];
		}
		for(int i=minpo;i<n-1;i++){
			b[i]=a[i+1];
		}
		for(int i=0;i<n-1;i++){
			System.out.print(b[i]+" ");
		}
	}
	
}

Python :

x=int(input())
m=list(map(int,input().split()))
b=[item for item in m if item>min(m)]
for item in b:
    print(item,end=" ")