题解 | #数组遍历#

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int[] ary = new int[6];
        int max;
        int min;
        Scanner scanner = new Scanner(System.in);
     	for (int i = 0; i <ary.length ; i++) {
            ary[i]=scanner.nextInt();
        }

        //write your code here......
        //冒泡排序
        for (int i = 0; i < ary.length; i++) {
            for (int i1 = i + 1; i1 < ary.length; i1++) {
                    if(ary[i1] < ary[i]) {
                        int temp = ary[i1];
                        ary[i1] = ary[i];
                        ary[i] = temp;
                    }
            }
        }
       max = ary[ary.length - 1];
        min = ary[0];

        System.out.println(max+" "+min);
    }
}