Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

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.

Input

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.

Output

Print the minimal cost in a line.

Constraints

$1 \leq n \leq 1,000$

$0 \leq w_i\leq 10^4$

$w_i$ are all different

Sample Input 1

5
1 5 3 4 2

Sample Output 1

7

Sample Input 2

4
4 3 2 1

Sample Output 2

10

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;

namespace ConsoleApp1
{
    class Program
    {
        public static void Main()
        {
            int n = int.Parse(Console.ReadLine());
            int[] A = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            var dict = new Dictionary<int, int>();
            var temp = A.OrderBy(x => x).ToArray();
            for (int i = 0; i < n; i++) dict[temp[i]] = i;
            bool[] visted = new bool[n];
            int s = temp[0];
            int result = 0;
            for (int i = 0; i < n; i++) {
                if (visted[i]) continue;
                int cur = i, sum = 0, min = A[i], an = 0;
                while (!visted[cur])
                {
                    visted[cur] = true;
                    an++;

                    if (min > A[cur]) min = A[cur];
                    sum += A[cur];
                    cur = dict[A[cur]];
                }
                result += Math.Min(sum + (an - 2) * min, min + sum + (an + 1) * s);
            }
            Console.WriteLine(result);
        }
    }
}