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: Time Limit Exceeded)

#include<stdio.h>

void selectionSort(int a[100], int N);
void swap(int *a, int *b){
    int c;
    c=*a;
    *a=*b;
    *b=c;

}

int main(void){
    int a[100],N,i,j;
    scanf("%d",&N);
    
    for(i=0;i<N;i++){
        scanf("%d ",&a[i]);
    }

    selectionSort(a,N);
}

void selectionSort(int a[100], int N){
    int i,j,minj,c,count;
    count = 0;

    for(i=0;i<N;i++){
        minj = i;
        for(j=i;i<N;j++){
            if(a[j]<a[minj])
                minj=j;
        }
        c=a[i];
        a[i]=a[minj];
        a[minj]=c;
        count++;
        
    }

    printf("%d",a[0]);
    if(N>1){
        for(i=1;i<N;i++)
            printf(" %d",a[i]);
    }
    printf("\n"); 
    printf("%d\n",count);
}