#include<stdio.h>
int findsecondmax(int ar[], int n)
{
int max = ar[0]>ar[1]?ar[0]:ar[1];
int smax = ar[0]<ar[1]?ar[0]:ar[1];
for (int i = 2; i < n; ++i)
{
if (max < ar[i])
{
smax = max;
max = ar[i];
}
else if (ar[i] > smax)
smax = ar[i];
}
return smax;
}
void main()
{
int ar[] = { 1,200,3,40,5,6,70,8,90 };
int n = sizeof(ar) / sizeof(ar[0]);
int max = findsecondmax(ar, n);
printf("%d", max);
}//今天上课受益匪浅