C++--------------------------------------获得整数数组第二大的数

#include <iostream>#include "people.h"#include "women.h"#include <assert.h>int find_sec_max(int data[],int count){    assert(count > 1);        int fir_max;    int sec_max;    fir_max=std::max(data[0],data[1]);    sec_max=std::min(data[0],data[1]);        for (int i=2; i<count; i++)    {        if (data[i] >= fir_max)        {            sec_max=fir_max;            fir_max=data[i];        }        else if (data[i] > sec_max)        {            sec_max=data[i];        }        else        {            ;        }    }    return sec_max;}int main(int argc, const char * argv[]) {        int d[]={0,9,5,4,22,11,88,232,56,5,35,56};    std::cout <<find_sec_max(d,12)<<std::endl;    return 0;}