Binary search on 1d array. The input should be sorted in asc

#include<iostream>
using namespace std;

int main() {
    int n, k, arr[1000000];
    cin >> n;
    for(int i = 0; i < n; i++) cin >> arr[i];
    cin >> k;
    int l = 0, r = n-1, mid, pos = -1;

    while(l<=r) {
        mid = (l+r) / 2;
        if(arr[mid]>k) {
            r = mid-1;
        } else if(arr[mid]<k) {
            l = mid+1;
        } else {
            pos = mid;
            break;
        }
    }

    if(pos!=-1) {
        cout << "Found at index: " << pos << endl;
    } else {
        cout << "Not found" << endl;
    }

    return 0;
}