NOJ选择排序

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<math.h>
void SelectionSort(int A[], int s, int m)
{
	int t,k;
	for (int i = s; i < m - 1; i++)
	{
		k = i;
		for (int j = i + 1; j < s + m; j++)
			if (A[k] < A[j]) k = j;
		if (i != k)
		{
			t = A[i];
			A[i] = A[k];
			A[k] = t;
		}
	}
}
int main()
{
	int A[100] = { 0 };
	int s, m, n, i = 0;
	scanf("%d", &n);
	for (; i < n; i++) scanf("%d", &A[i]);
	scanf("%d%d", &s, &m);
	SelectionSort(A, s, m);
	for (i = 0; i < n; i++) printf("%d ", A[i]);
	return 0;
}