為什么我怎么運(yùn)行都是1

#include <stdlib.h>

#include<iostream>

using namespace std;

int getmaxormin(int*arr, int count, bool ismax)

{

int sum = arr[0];

for (int i = 0; i < count; i++)

{

if (ismax)

{

if (sum < arr[i])

{

sum = arr[i];

}

}

else{

if (sum > arr[i])

{

sum = arr[i];

}

}

return sum;

}

}

int main(void)

{

int arr1[6] = { 1, 2, 9, 6, 7, 4 };

bool ismax = false;

cin >> ismax;

cout << getmaxormin(arr1, 6, ismax) << endl;

system("pause");

return 0;

}