output_description: Print the maximum total comfort the N players can get.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 \dots A_N
attempt: import sys
  from heapq import heappush, heappop
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def list4d(a, b, c, d, e):
      return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST(N=None):
      return list(MAP()) if N is None else [INT() for i in range(N)]
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = 10**19
  MOD = 10**9 + 7
  EPS = 10**-10
  
  N = INT()
  A = LIST()
  
  A.sort(reverse=1)
  que = [-A[0]]
  ans = 0
  for i in range(1, N):
      cur = -heappop(que)
      ans += cur
      heappush(que, -A[i])
      heappush(que, -A[i])
  print(ans)
  
problem_description: 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?
samples: [{"input": "4\n    2 2 1 3", "output": "7\n    \n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the\ncircle as shown in the figure, they can get the total comfort of 7.\n\n![Figure](https://img.atcoder.jp/ghi/766a260a0019ea93e86e0588cc4db868.png)\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\n* * *"}, {"input": "7\n    1 1 1 1 1 1 1", "output": "6"}]