Problem:
Score: 400 points

Problem Statement

Quickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.

The N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.

When each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.

What is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?

Constraints

All values in input are integers.

2 \leq N \leq 2 \times 10^5

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \dots A_N

Output

Print the maximum total comfort the N players can get.

Sample Input 1

4
2 2 1 3

Sample Output 1

7

By arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.

They cannot get the total comfort greater than 7, so the answer is 7.

Sample Input 2

7
1 1 1 1 1 1 1

Sample Output 2

6

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}
// D
fn main() {
  let n: i32 = read();

  let s: String = read();
  let mut result: i64 = 0;
  let mut v: Vec<i32> = s.split(" ").map(|s| s.parse().unwrap()).collect();
  v.sort_by(|a, b| b.cmp(a));
  //println!("{:?}", v)
  /*let mut t = n - 1;
  for i in 0..n {
    let mut lim = 2;
    if i == 0 { lim = 1; }
    for _j in 0..lim {
      if t > 0 {
        result += v[i as usize] as i64;
        t-=1;
      }
    }
  }
  println!("{}", result);
  */
  println!("{}", calc_comfort(v));
}

fn calc_comfort(a: Vec<i32>) -> i64 {
  let ref mut comfort: Vec<i32> = Vec::new();
  let mut c_result: i64 = 0;
  for v in a {
    //println!("{:?} {}", comfort, c_result);
    if comfort.len() == 0 {
      comfort.push(v);
      continue;
    } else if comfort.len() == 1 {
      comfort.push(v);
      c_result += comfort[0] as i64;
      continue;
    }
    let (j, c): (usize, i32) = calc_insert_index_comfort(comfort.clone(), v);
    comfort.insert(j, v);
    c_result += c as i64;
  }
  c_result
  /*c_result += a[0] as i64;
  let h = calc_keta((a.len() - 1) as i32, 2) - 1;
  let n: usize  = calc_node_num(h) as usize;
  // 両方の葉がないノードの探索
  let node = a.len() - 1;
  let diff: usize = calc_node_num(h + 1) - node;
  let n_1 = diff / 2;
  let amari = diff % 2;
  //println!("a: {}, H: {}, N: {}, n_1: {}, amari:{}, diff: {}",a.len() - 1, h, n, n_1, amari, diff);
  for v in 1..n + 1 - n_1 - amari{
    c_result += (a[v] * 2) as i64;
  }
  //println!("c_result: {}", c_result);
  if amari == 1 {
    c_result += a[n + 1 - n_1 - amari] as i64;
  }
  c_result*/
}

fn calc_node_num(h: usize) -> usize {
  if h == 1 {
    1
  } else {
    pow(2, (h-1) as i32) as usize + calc_node_num(h - 1)
  }
}

// baseのp乗
fn pow(base: i32, p: i32) -> i32 {
  let mut result: i32 = base;
  for _i in 0..p - 1 {
      result *= base;
  }
  //println!("{}, {}, {}",base, p, result);
  result
}
// 10進数でnumが基数kisuで何桁の数字であるかを返す関数
fn calc_keta(mut num: i32, kisu: i32) -> usize {
  let mut count = 0;
  if num == 0 {
      return 0;
  }
  while num / kisu != 0{
    count += 1;
    num /= kisu;
  }
  count += 1;
  count
}
fn calc_insert_index_comfort(c: Vec<i32>, t: i32) -> (usize, i32) {
  let mut index: usize = 0;
  let mut max: i32 = 0;
  let mut m = 0;
  for i in 0..c.len() - 1 {
    if c[i] < c[i + 1] {
      m = c[i];
    } else {
      m = c[i + 1];
    }
    if max < m {
      index = i;
      max = m;
    }
  }
  
  if c[0] < c[c.len() - 1] {
    m = c[0];
  } else {
    m = c[c.len() - 1];
  }
  if max < m {
    index = 0;
    max = m;
  }
  if index == 0  && c[1] == c[c.len() - 1]{
    index = c.len() - 1;
  }
  (index, max)
}