Skip to content

Instantly share code, notes, and snippets.

@qkreltms
Created March 3, 2018 15:41
Show Gist options
  • Save qkreltms/dd50640e40b56030ed275c9ff68efcdc to your computer and use it in GitHub Desktop.
Save qkreltms/dd50640e40b56030ed275c9ff68efcdc to your computer and use it in GitHub Desktop.
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static int solve(int length, int[] times_to_wait_in_line) {
Arrays.sort(times_to_wait_in_line);
int cal = Arrays.stream(times_to_wait_in_line)
.reduce((a, b) -> a + b)
.getAsInt();
int result = cal;
for (int i = length - 1; i > 0; i--) {
cal -= times_to_wait_in_line[i];
result += cal;
}
return result;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int length = sc.nextInt();
int[] times_to_wait_in_line = new int[length];
for (int i = 0; i < length; i++) {
times_to_wait_in_line[i] = sc.nextInt();
}
System.out.println(Main.solve(length, times_to_wait_in_line));
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment