代码实现:
import java.util.Scanner;
public class xzd {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[] a=new int[10001];
int min,middle = 0,max;
double middle1 = 0;
int flag = 0;
//输入
for (int i=0;i<n;i++){
a[i]=scanner.nextInt();
}
//最小数
if (a[0]>a[n-1]){
min=a[n-1];
}else{
min=a[0];
}
//中位数
if (n%2==1){
middle = a[n/2];
}else {
flag=(a[n/2]+a[n/2-1])%2;
if (flag==1){
middle1 = (double