output_description: Print the minimal cost in a line.
input_description: In the first line, an integer $n$ is given. In the second line, $n$ integers
  $w_i (i = 0, 1, 2, ... n-1)$ separated by space characters are given.
attempt: n = int(input())
  array = [int(i) for i in input().split()]
  temp = array.copy()
  array.sort()
  w = 0
  for i in range(n):
      for j in range(n):
          if i != j and temp[i] == array[j]:
              array[i], array[j] = array[j], array[i]
              w += array[i]
              w += array[j]
  print(w)
  
problem_description: Minimum Cost Sort
  
  You are given $n$ integers $w_i (i = 0, 1, ..., n-1)$ to be sorted in
  ascending order. You can swap two integers $w_i$ and $w_j$. Each swap
  operation has a cost, which is the sum of the two integers $w_i + w_j$. You
  can perform the operations any number of times.
  
  Write a program which reports the minimal total cost to sort the given
  integers.
samples: [{"input": "5\n    1 5 3 4 2", "output": "7"}, {"input": "4\n    4 3 2 1", "output": "10"}]