수열 특징 빠 른 정렬 블 루 브리지 자바

import java.util.Scanner;

public class Main {
     
    public static void quickSort(int[] arr,int low,int high){
     
        int i,j,temp,t;
        if(low>high){
     
            return;
        }
        i=low;
        j=high;
        //temp     
        temp = arr[low];
 
        while (i<j) {
     
            //    ，      
            while (temp<=arr[j]&&i<j) {
     
                j--;
            }
            //    ，      
            while (temp>=arr[i]&&i<j) {
     
                i++;
            }
            //         
            if (i<j) {
     
                t = arr[j];
                arr[j] = arr[i];
                arr[i] = t;
            }
 
        }
        //       i j         
         arr[low] = arr[i];
         arr[i] = temp;
        //        
        quickSort(arr, low, j-1);
        //        
        quickSort(arr, j+1, high);
    }
 
 
    public static void main(String[] args){
     
    	Scanner input = new Scanner(System.in);
    	int n= input.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < arr.length; i++) {
     
			arr[i] = input.nextInt();
		}
        quickSort(arr, 0, arr.length-1);
        int sum=0;
        for (int i = 0; i < arr.length; i++) {
     
            sum = sum+arr[i];
        }
        System.out.println(arr[n-1]);
        System.out.println(arr[0]);
        System.out.println(sum);
    }
}