求一组整数的第二大数

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
const int MINNUM = -32767;
int find(int array[],int size)
{
    if (size < 0 || size == 0)
        return -1;

    int maxnum = array[0];
    int secmax = MINNUM;
    for (int i = 0; i < size;i++)
    {
        if (array[i]>maxnum)
        {
            secmax = maxnum;
            maxnum = array[i];
        }
        else
        {
            if (secmax<array[i])
            {
                secmax = array[i];
            }
        }
    }
    return secmax;
}
void test()
{

    int array[] = {23,543,78,189,21,34,10,567};
    int sec_max=find(array,8);
    cout << "第二大整数为：" << sec_max << endl;
}
int main()
{
    test();
    system("pause");
    return 0;
}