If key is the Greatest element in array using Binary Search

#include <iostream>
#include <cstdlib>
#include <stdio.h>
#include <assert.h>
using namespace std;
​
int BinarySearch(int arr[],int n,int key)
{
    int low=0 ,high=n ,mid ,Max = -1;
​
    while(low <= high)
    {
​
        mid = low+(high-low)/2;
​
        if(arr[mid] == key)
        {
            low = low+1;   //key paoar por o right e aro khujbo
        }
        else if(arr[mid] > key)
        {
            Max = mid;
            high = mid-1;
        }
        else
        {
            low = low+1;
        }
​
    }
    return Max;
}
​
int main()
{
    int arr[] = {1,2,2,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
    int found = BinarySearch(arr,15,2);
    cout<<found<<endl;
    return 0;
}