九度OJ1053 互换最大最小数

#include<iostream>
using namespace std;

int main()
{
int n = 0;
while (cin>>n)
{
int a[20] = {0};
int maxnum = 0, minnum = 0;	//记录最大值，最小值
int sm = 0, sn = 0;	//记录最大值，最小值的位置
int temp = 0;	//交换变量
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
maxnum = a[0];
minnum = a[0];

for (int i = 1; i < n; i++)
{
if (a[i] > maxnum)
{
maxnum = a[i];
sm = i;
}
if (a[i] < minnum)
{
minnum = a[i];
sn = i;
}
}
//交换
temp = a[sm];
a[sm] = a[sn];
a[sn] = temp;

//输出
for (int i = 0; i < n - 1; i++)
{
cout<<a[i]<<" ";
}
cout<<a[n - 1]<<endl;
}
return 0;
}