import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
int n = sc.nextInt();
int []arr = new int [n];
for(int i = 0; i < n; i++){
arr[i] = sc.nextInt();
}
int m = sc.nextInt();
int index = -1;
for(int i = 0; i < n; i++){
if(arr[i] == m){
index = i;
break;
}
}
if(index != -1){
for(int i = index; i < n - 1; i++){
arr[i] = arr[i + 1];
}
for(int j = 0; j < n - 1; j++){
System.out.printf("%d ",arr[j]);
}
System.out.println();
}else{
for(int i = 0; i < n; i++){
System.out.printf("%d ",arr[i]);
}
System.out.println();
}
}
}
}
先存储元素,再定义一个下标为-1,然后开始找所要的元素,找到了,把下标改成它的下标,然后将他后面的元素向前移一位,没找的,按原来的数组输出。