Problem:
Selection Sort

Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

SelectionSort(A)
1 for i = 0 to A.length-1
2 mini = i
3 for j = i to A.length-1
4 if A[j] < A[mini]
5 mini = j
6 swap A[i] and A[mini]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by space characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

6
5 6 4 2 1 3

Sample Output 1

1 2 3 4 5 6
4

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
3

Solution in C# (judge verdict: Accepted)

using System;
using System.IO;
using System.Reflection;
using System.Collections.Generic;
using System.Text;
using System.Linq;
 
namespace AOJ
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            string[] str = Console.ReadLine().Split(' ');
            int[] sortArray = str.Select(s => int.Parse(s)).ToArray();
            int executeNum = 0;
            for (int i = 0; i < n - 1; ++i)
            {
                int minj = i;
                for (int j = i+1; j < n ; ++j)
                {
                    if (sortArray[j] < sortArray[minj])
                    {
                        minj = j;
                        
                    }
                    
                }
                if(sortArray[minj] < sortArray[i])
                {
                    swap(ref sortArray[i], ref sortArray[minj]);
                    ++executeNum;
                }
                
            }
            for (int i = 0; i < n; ++i)
            {
                Console.Write(sortArray[i]);
                if (i != n - 1)
                {
                    Console.Write(" ");
                }
            }
            Console.Write("\n");
            Console.WriteLine(executeNum);
        }
        public static void swap(ref int x ,ref int y)
        {
            int temp = x;
            x = y;
            y = temp;
        }
    }
}