Java：贪心排序，求学校的位置

解题思路：用双重for循环计算每个点到其它点的路径之和，取路径之和最小且位置最小的点为学校 

import java.util.*;
//求无向完全图的单源最短路径
public class Main {
    public static void main(String[] args) {
        //数据输入
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        int array[] = new int[num];
        for (int i = 0; i < num; i++) {
            array[i] = in.nextInt();
        }
        int position = 0;//学生家
        int distance = 0;//该学生家到其它学生家的距离总和
        int min_position = 0;//学校位置
        int min_distance = 0;//学校到所有学生家的距离总和最小
        int d = 0;
        for (int i = 0; i < num; i++) {
            position = array[i];
            for (int j = 0; j < num; j++) {
                d = array[i] - array[j];
                if (d < 0) { //取绝对值
                    d *= -1;
                }
                distance =distance+d;
            }
            if (i == 0) {
                min_position=array[i];
                min_distance = distance;
            } else {
                if (distance < min_distance) {
                    min_position=position;
                    min_distance = distance;
                } else if (distance == min_distance && position < min_position) {
                    min_position=position;
                }
            }
            distance = 0;
        }
        System.out.print("学校位置："+min_position);
    }
}