[JAVA] Baekjoon 그리디 알고리즘 11399번 : ATM

 

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

import java.util.Scanner;   public class Main {     public static void main(String[] args) {         Scanner sc = new Scanner(System.in);         int person = sc.nextInt();            //인원수 입력값 받음.         int [] arr = new int[person];         int sum =0;                  for(int i=0;i<person;i++) {        //인원수만큼 대기번호 입력받음.             arr[i] = sc.nextInt();         }         for(int i=0;i<person;i++) {             for(int j=0;j<person;j++) {                 if(arr[i]<arr[j]) {                //올림차순으로 정렬                     int tmp = arr[i];                     arr [i] = arr[j];                     arr[j] = tmp;                 }             }         }         for(int i=0;i<person;i++) {                     if(i > 0) {                                //-1의 방에는 값이 없기 때문에 if문으로 막아주기                 arr[i] = arr[i]+arr[i-1];        //정렬된 배열의 값 i = i + i-1 로 변환                  }             sum += arr[i];                        //sum 변수에는 arr[i] 의 값들을 더해주기         }         System.out.print(sum);            //sum 출력         sc.close();     } }