public int BinarySearch(int[] arr, int lo, int hi, long target) { int res = hi + 1; while(lo <= hi) { int mid = lo + (hi - lo) / 2; if(arr[mid] > target) { res = mid; hi = mid - 1; } else { lo = mid + 1; } } return res; }