选择排序 Selection Sort Aizu - ALDS1_2_B

题目：

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

题意：

输入n后，输入n个待排序序列。求由小到大进行选择排序后的结果以及选择排序中交换元素的次数。

#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

int a[110];

int main(){
	ios::sync_with_stdio(false);
	int n;
	cin>>n;
	for(int i = 1 ; i<=n ; i++){
		cin>>a[i];
	}
	
	int ans = 0;
	
	for(int i = 1 ; i<=n-1 ; i++){
		int min = a[i];
		int flag = i;
		for(int j = i+1 ; j<=n ; j++){
			if(min > a[j]){
				flag = j;
				min = a[j];
			}
		} 
		if(flag != i){
			swap(a[flag] , a[i] );
			ans++;
		}
	}
	
	for(int i = 1 ; i<=n ; i++){
		if(i == 1)
			cout<<a[i];
		else{
			cout<<" "<<a[i];
		}
	}
	cout<<endl;
	cout<<ans<<endl;
	return 0;
}