寻找中间数(代码)

#include<iostream>

using namespace std;

int main()
{
    int n,count=1,numcount;
    int *num;
    int temp;
    bool flag=true;
    bool isfound=false;
    int founnumber;

    cin>>n;
    num=new int[n];
    for(int i=0;i<n;i++)
    {
        cin>>num[i];
    }

    //sort
    for(int i=0;i<n;i++)
    {
        for(int m=i;m<n;m++)
        {
            if(num[i]>num[m])
            {
                temp=num[i];
                num[i]=num[m];
                num[m]=temp;
            }
        }
    }

    //ji shu 
    if(n%2==1)
    {
        numcount=(n-1)/2;
        while(flag)
        {
            if(num[numcount-count]==num[numcount]&&num[numcount]==num[numcount+count])
            {
                count++;
            }
            else if(num[numcount-count]!=num[numcount]&&num[numcount+count]==num[numcount])
                flag=false;
            else if(num[numcount-count]==num[numcount]&&num[numcount+count]!=num[numcount])
                flag=false;
            else
            {
                flag=false;
                isfound=true;
            }
        }
    }


    //ou shu
    else if(n%2==0)
    {
        numcount=n/2;
        if(num[numcount]!=num[numcount-1])
        {
            flag=false;
        }
        while(flag)
        {
            if(num[numcount-count-1]==num[numcount]&&num[numcount]==num[numcount+count])
            {
                count++;
            }
            else if(num[numcount-count-1]!=num[numcount]&&num[numcount+count]==num[numcount])
                flag=false;
            else if(num[numcount-count-1]==num[numcount]&&num[numcount+count]!=num[numcount])
                flag=false;
            else
            {
                flag=false;
                isfound=true;
            }
        }

    }

    if(isfound)
        cout<<num[numcount];
    else
        cout<<"-1";

    return 0;

}