diff --git "a/\346\225\260\347\273\204\347\273\203\344\271\240/\350\224\241\344\270\234\347\224\237/dsedfa1.java" "b/\346\225\260\347\273\204\347\273\203\344\271\240/\350\224\241\344\270\234\347\224\237/dsedfa1.java"
new file mode 100644
index 0000000000000000000000000000000000000000..637317b1d67a44c19f727c83d5806e8678cd16f3
--- /dev/null
+++ "b/\346\225\260\347\273\204\347\273\203\344\271\240/\350\224\241\344\270\234\347\224\237/dsedfa1.java"
@@ -0,0 +1,50 @@
+import java.util.Scanner;
+
+public class dsedfa1 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		System.out.println("fdsafasfddasdf");
+
+		Scanner sc = new Scanner(System.in);
+		int arr[] = new int[6];
+
+		int max = arr[0];
+		int min = arr[0];
+		int sum = 0;
+		int index = 0;
+
+		for (int i = 0; i < arr.length; i++) {
+			System.out.println("请输入分数");
+			int abd = sc.nextInt();
+			if (abd > 0 && abd < 100) {
+				arr[i] = abd;
+			} else {
+				System.out.println("输入数据不在范围");
+				i--;
+			}
+
+		}
+
+		for (int i = 0; i < arr.length; i++) {
+			if (max > arr[i]) {
+				max = arr[i];
+			}
+		}
+
+		for (int i = 0; i < arr.length; i++) {
+			if (min < arr[i]) {
+				min = arr[i];
+			}
+		}
+
+		for (int i = 0; i < arr.length; i++) {
+			sum = arr[i] + sum;
+		}
+		int asd = sum - max - min;
+
+		System.out.println(asd / 4);
+
+	}
+
+}